Interdicting structured combinatorial optimization problems with {0, 1}-objectives
Year of publication: |
February 2017
|
---|---|
Authors: | Chestnut, Stephen R. ; Zenklusen, Rico |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 1, p. 144-166
|
Subject: | interdiction | robustness | matroids | approximation algorithms | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Integral flow decomposition with minimum longest path length
Pieńkosz, Krzysztof, (2015)
-
Vector scheduling with rejection on a single machine
Li, Weidong, (2018)
-
Levi, Retsef, (2019)
- More ...
-
Approximate dynamic programming for stochastic linear control problems on compact state spaces
Woerner, Stefan, (2015)
-
An adaptive routing approach for personal rapid transit
Schüpbach, Kaspar, (2013)
-
A 2-approximation for the maximum satisfying bisection problem
Ries, Bernard, (2011)
- More ...