Sequential competitive facility location : exact and approximate algorithms
Year of publication: |
2024
|
---|---|
Authors: | Qi, Mingyao ; Jiang, Ruiwei ; Shen, Siqian |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 72.2024, 1, p. 300-316
|
Subject: | approximation algorithm | branch-and-cut | competitive facility location | concave overestimation | mixed-integer nonlinear programming | Optimization | submodularity | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Standorttheorie | Location theory | Räumlicher Wettbewerb | Spatial competition | Nichtlineare Optimierung | Nonlinear programming | Ganzzahlige Optimierung | Integer programming |
-
A new heuristic formulation for a competitive maximal covering location problem
Seyhan, Tolga H., (2018)
-
Latifi, Seyyed Ebrahim, (2022)
-
A new mathematical model for the Weber location problem with a probabilistic polyhedral barrier
Amiri-Aref, Mehdi, (2013)
- More ...
-
Wang, Xin, (2023)
-
Integer programming approaches for appointment scheduling with random no-shows and service durations
Jiang, Ruiwei, (2017)
-
Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
Jiang, Ruiwei, (2018)
- More ...