Robust MILP formulations for the two-stage weighted vertex p-center problem
| Year of publication: |
2023
|
|---|---|
| Authors: | Duran-Mateluna, Cristian ; Ales, Zacharie ; Elloumi, Sourour ; Jorquera-Bravo, Natalia |
| 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. 159.2023, p. 1-13
|
| Subject: | -center problem | algorithm | Discrete location | Robust MILP formulations | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
Yanıkoğlu, İhsan, (2022)
-
Complexity of strict robust integer minimum cost flow problems : an overview and further results
Chassein, André, (2019)
-
Algorithms and complexity analysis for robust single-machine scheduling problems
Tadayon, Bita, (2015)
- More ...
-
An efficient benders decomposition for the p-median problem
Duran-Mateluna, Cristian, (2023)
-
A rounding and clustering-based exact algorithm for the p-center problem
Ales, Zacharie, (2025)
-
A tighter formulation of the p-median problem
Elloumi, Sourour, (2010)
- More ...