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 . ISSN 1862-4472 (Print) 1862-4480 (Online) Published Online First http://dx.doi.org/10.1007/s11590-020-01684-y
There is a more recent version of this item available.
![[thumbnail of Altekin-Dasci-Karatas_2021.pdf]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
PDF
Altekin-Dasci-Karatas_2021.pdf
Restricted to Registered users only
Download (1MB) | Request a copy
Official URL: http://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: | location, maximum capture, random utility model, competitive facility location, conic programming |
| Subjects: | H Social Sciences > H Social Sciences (General) |
| Divisions: | Sabancı Business School Sabancı Business School > Operations Management and Information Systems |
| Depositing User: | Abdullah Daşcı |
| Date Deposited: | 28 Aug 2021 13:03 |
| Last Modified: | 26 Apr 2022 10:27 |
| URI: | https://research.sabanciuniv.edu/id/eprint/42323 |
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) [Currently Displayed]
Actions (login required)
- View Item