The complexity of computing a robust flow
Year of publication: |
2020
|
---|---|
Authors: | Disser, Yann ; Matuschke, Jannik |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 1, p. 18-23
|
Subject: | Complexity theory | Network flows | Network interdiction | Robust optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Robustes Verfahren | Robust statistics | Komplexe Systeme | Complex systems | Unternehmensnetzwerk | Business network | Netzwerk | Network | Komplexitätsmanagement | Complexity management |
-
Single-commodity robust network design problem : complexity, instances and heuristics solutions
Álvarez-Miranda, Eduardo, (2014)
-
Protection of flows under targeted attacks
Matuschke, Jannik, (2017)
-
Delage, Erick, (2018)
- More ...
-
Hiring secretaries over time : the benefit of concurrent employment
Disser, Yann, (2020)
-
Matchings with lower quotas: Algorithms and complexity
Arulselvan, Ashwin, (2017)
-
New and simple algorithms for stable flow problems
Cseh, Ágnes, (2018)
- More ...