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)
-
Distributionally robust facility location with bimodal random demand
Shehadeh, Karmel S., (2021)
-
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
Gadegaard, Sune Lauth, (2018)
- More ...
-
Lagrangian decompositions for the two-level FTTx network design problem
Bley, Andreas, (2013)
-
Limited diversity : business models of German cooperative banks
Bley, Andreas, (2018)
-
Eurozone : auf der Suche nach einer tragfähigen Fiscal Governance
Bley, Andreas, (2011)
- More ...