 | 2011 |
|---|
| 8 |       | Arie M. C. A. Koster,
Manuel Kutschka:
An integrated model for survivable network design under demand uncertainty.
DRCN 2011: 54-61 |
| 7 | | Arie M. C. A. Koster,
Manuel Kutschka,
Christian Raack:
On the Robustness of Optimal Network Designs.
ICC 2011: 1-5 |
| 6 | | Arie M. C. A. Koster,
Manuel Kutschka,
Christian Raack:
Cutset Inequalities for Robust Network Design.
INOC 2011: 118-123 |
| 5 | | Christina Büsing,
Arie M. C. A. Koster,
Manuel Kutschka:
Recoverable Robust Knapsacks: Γ-Scenarios.
INOC 2011: 583-588 |
| 4 | | Christina Büsing,
Arie M. C. A. Koster,
Manuel Kutschka:
Recoverable robust knapsacks: the discrete scenario case.
Optimization Letters 5(3): 379-392 (2011) |
| 2010 |
|---|
| 3 | | Arie M. C. A. Koster,
Manuel Kutschka,
Christian Raack:
Towards robust network design using integer linear programming techniques.
NGI 2010: 1-8 |
| 2009 |
|---|
| 2 | | Arie M. C. A. Koster,
Adrian Zymolka,
Manuel Kutschka:
Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.
Algorithmica 55(2): 375-391 (2009) |
| 2007 |
|---|
| 1 | | Arie M. C. A. Koster,
Adrian Zymolka,
Manuel Kutschka:
Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts.
ESA 2007: 693-704 |
Data released under the ODC-BY 1.0 license — See also our legal information page