The incremental connected facility location problem
Year of publication: |
2019
|
---|---|
Authors: | Arulselvan, Ashwin ; Bley, Andreas ; Ljubić, Ivana |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 112.2019, p. 1-17
|
Subject: | Mixed integer programming | Facility location | Branch-and-cut | Multi-period network design | Incremental network design | Ganzzahlige Optimierung | Integer programming | Betriebliche Standortwahl | Firm location choice | Standorttheorie | Location theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Sequential competitive facility location : exact and approximate algorithms
Qi, Mingyao, (2024)
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
-
Facility location with matroid or knapsack constraints
Krishnaswamy, Ravishankar, (2015)
- More ...
-
Lagrangian decompositions for the two-level FTTx network design problem
Bley, Andreas, (2013)
-
Matchings with lower quotas: Algorithms and complexity
Arulselvan, Ashwin, (2017)
-
Discrete time dynamic traffic assignment models and solution algorithm for managed lanes
Zheng, Qipeng, (2011)
- More ...