Linear and conic reformulations for the maximum capture location problem under multinomial logit choice
This paper presents three reformulations for the well-known maximum capture location problem under multinomial logit choice. The problem can be cast as an integer fractional program and it has been the subject of several linear reformulations in the past. Here we develop two linear and a conic refor...
Saved in:
Published in | Optimization letters Vol. 15; no. 8; pp. 2611 - 2637 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.11.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!