Complexity of strict robust integer minimum cost flow problems : an overview and further results
Year of publication: |
2019
|
---|---|
Authors: | Chassein, André ; Kinscherff, Anika |
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. 104.2019, p. 228-238
|
Subject: | Robust optimization | Integral flows | Combinatorial optimization | Labeling algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Robustes Verfahren | Robust statistics | Ganzzahlige Optimierung | Integer programming |
-
Benchmarking problems for robust discrete optimization
Goerigk, Marc, (2024)
-
Integrated anesthesiologist and room scheduling for surgeries : methodology and application
Rath, Sandeep, (2017)
-
Algorithms and complexity analysis for robust single-machine scheduling problems
Tadayon, Bita, (2015)
- More ...
-
Ranking robustness and its application to evacuation planning
Goerigk, Marc, (2018)
-
A bicriteria approach to robust optimization
Chassein, André, (2016)
-
Inverse eccentric vertex problem on networks
Nguyen, Kien T., (2015)
- More ...