A branch-and-bound algorithm for the maximum capture problem with random utilities
Year of publication: |
2016
|
---|---|
Authors: | Freire, Alexandre S. ; Moreno, Eduardo ; Yushimito, Wilfredo F. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 252.2016, 1 (1.7.), p. 204-212
|
Subject: | Facility location | Branch and bound | Maximum capture | Random utility model | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Standorttheorie | Location theory |
-
A separation algorithm for the simple plant location problem
Galli, Laura, (2021)
-
Branch-and-bound algorithm for a competitive facility location problem
Beresnev, Vladimir, (2013)
-
Bansal, Manish, (2017)
- More ...
-
An integer linear programming approach for bilinear integer programming
Freire, Alexandre S., (2012)
-
An integer linear programming approach for bilinear integer programming
Freire, Alexandre S., (2012)
-
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
CampĂȘlo, Manoel, (2022)
- More ...