A new heuristic formulation for a competitive maximal covering location problem
Year of publication: |
September-October 2018
|
---|---|
Authors: | Seyhan, Tolga H. ; Snyder, Lawrence V. ; Zhang, Ying |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 52.2018, 5, p. 1156-1173
|
Subject: | competitive facility location | Stackelberg game | bi-level programming | greedy add algorithm | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Spieltheorie | Game theory | Heuristik | Heuristics | Standorttheorie | Location theory | Räumlicher Wettbewerb | Spatial competition | Duopol | Duopoly | Wettbewerb | Competition |
-
A local search heuristic for the (r|p)-centroid problem in the plane
Davydov, I., (2014)
-
A Stackelberg hub arc location model for a competitive environment
Sasaki, Mihiro, (2014)
-
Exact method for the capacitated competitive facility location problem
Beresnev, Vladimir, (2018)
- More ...
-
The competitive facility location problem under disruption risks
Zhang, Ying, (2016)
-
Reliable logistics networks design with facility disruptions
Peng, Peng, (2011)
-
A tight approximation for an EOQ model with supply disruptions
Snyder, Lawrence V., (2014)
- More ...