Altekin, Tevhide and Daşcı, Abdullah and Karatas, Mumtaz (2021) Linear and conic reformulations for the maximum capture location problem under multinomial logit choice. Optimization Letters, 15 (8). pp. 2611-2637. ISSN 1862-4472 (Print) 1862-4480 (Online)
This is the latest version of this item.
Official URL: https://dx.doi.org/10.1007/s11590-020-01684-y
Abstract
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 reformulation based on alternative treatments of fractional programs. Numerical experiments conducted on established sets of instances have shown that conic reformulation has greatly improved the solution times as well as the size of the solvable problems as compared to the most successful reformulations to date.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Competitive facility location; Conic programming; Location; Maximum capture; Random utility model |
| Divisions: | Sabancı Business School |
| Depositing User: | Tevhide Altekin |
| Date Deposited: | 31 Aug 2022 15:30 |
| Last Modified: | 31 Aug 2022 15:30 |
| URI: | https://research.sabanciuniv.edu/id/eprint/43599 |
Available Versions of this Item
-
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice. (deposited 28 Aug 2021 13:03)
- Linear and conic reformulations for the maximum capture location problem under multinomial logit choice. (deposited 31 Aug 2022 15:30) [Currently Displayed]
Actions (login required)
- View Item