用户名: 密码: 验证码:
A branch-and-bound algorithm for the maximum capture problem with random utilities
详细信息    查看全文
文摘

We discuss about linear and nonlinear integer reformulation for the maximum capture problem with random utilities.

We strengthen the best-know MILP formulation for this problem.

We present a greedy algorithm to solve a new relaxation of this problem.

We embed these algorithms in a branch-and-bound scheme to solve the integer problem.

We computationally benchmark our algorithm with current MIP and MINLP formulation on a exhaustive dataset.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700