Integer programming formulations for three sequential discrete competitive location problems with foresight
Year of publication: |
16 March 2018
|
---|---|
Authors: | Gentile, José ; Pessoa, Artur ; Poss, Michael ; Roboredo, Marcos Costa |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 3 (16.3.), p. 872-881
|
Subject: | Combinatorial optimization | Maximal covering location problem | Competitive location | Integer programming | Stackelberg problem | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Standorttheorie | Location theory | Standortwettbewerb | Territorial competition |
-
A new heuristic formulation for a competitive maximal covering location problem
Seyhan, Tolga H., (2018)
-
Paul, Nicholas R., (2017)
-
Rezazadeh, Hassan, (2018)
- More ...
-
A branch-and-cut algorithm for the discrete (r/p)-centroid problem
Roboredo, Marcos Costa, (2013)
-
An exact approach for the r-interdiction median problem with fortification
Roboredo, Marcos Costa, (2019)
-
Exact methods for the discrete multiple allocation (r|p) hub-centroid problem
Araújo, Antonio Camargo Andrade de, (2020)
- More ...