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 | Standorttheorie | Location theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Spieltheorie | Game theory | Ganzzahlige Optimierung | Integer programming | Räumlicher Wettbewerb | Spatial competition | Algorithmus | Algorithm | Standortwettbewerb | Territorial competition |
-
A local search heuristic for the (r|p)-centroid problem in the plane
Davydov, I., (2014)
-
Sequential competitive facility location : exact and approximate algorithms
Qi, Mingyao, (2024)
-
Bagherinejad, Jafar, (2018)
- More ...
-
The competitive facility location problem under disruption risks
Zhang, Ying, (2016)
-
Fundamentals of supply chain theory
Snyder, Lawrence V., (2011)
-
Pricing during Disruptions : Order Variability versus Profit
Feng, Xiaojing, (2020)
- More ...