Result 1 to 10 of 10 total
New results about multi-band uncertainty in robust optimization. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 63-74 (2012).
1
Recoverable robust shortest path problems. (English)
Networks 59, No. 1, 181-189 (2012).
2
Recoverable robust knapsacks: $Γ$-scenarios. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 583-588 (2011).
3
Line planning, path constrained network flow and inapproximability. (English)
Networks 57, No. 1, 106-113 (2011).
4
Recoverable robust knapsacks: the discrete scenario case (English)
Optimization Letters 5, No. 3, 379-392 (2011).
5
Recoverable robust knapsacks: $Γ$-scenarios (English)
INOC, 583-588 (2011).
6
Robust algorithms for sorting railway cars. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 350-361 (2010).
7
Graph optimization and network optimization. (Graphen- und Netzwerkoptimierung.) (German)
Heidelberg: Spektrum Akademischer Verlag (ISBN 978-3-8274-2422-8/pbk; 978-3-8274-2423-5/ebook). xii, 265~p. EUR~18.64/net; SFR~29.00 (2010).
8
Robust algorithms for sorting railway cars (English)
ESA (1), 350-361 (2010).
9
The exact subgraph recoverable robust shortest path problem (English)
Robust and Online Large-Scale Optimization, 231-248 (2009).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
