Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 24, Issue 4, Pages 385-416Publisher
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1021279918708
Keywords
fractional programming; convex extensions; facility location
Ask authors/readers for more resources
We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch and bound algorithm for 0-1 hyperbolic programs. The main feature of the algorithm is that it reformulates the problem at every node of the search tree. We demonstrate that this algorithm has a superior convergence behavior than directly solving the relaxation derived at the root node. The algorithm is used to solve a discrete p-choice facility location problem for locating ten restaurants in the city of Edmonton.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available