Desktop-Bild

Dr. rer. nat. Manuel Kutschka

Kontakt / Lebenslauf / Forschung / Dissertation / Veröffentlichungen / Vorträge / Konferenzen und Workshops / Lehre


Publications 2019
Formulations and algorithms for the recoverable Γ-robust knapsack problem  
Christina Büsing, Sebastian Goderbauer, Arie M.C.A. Koster, Manuel Kutschka
EURO Journal on Computational Optimization 7 (2019), no. 1, 15--45.
 
Publications 2015
Robust Metric Inequalities for Network Loading Under Demand Uncertainty  
Grit Claßen, Arie M.C.A. Koster, Manuel Kutschka, Issam Tahiri
Asia-Pacific Journal of Operational Research 32 (2015), no. 5, 1550038-1--27.
 
Publications 2014
Network planning under demand uncertainty with robust optimization  
T. Bauschert, Christina Büsing, Fabio Dandreagiovanni, Arie M.C.A. Koster, Manuel Kutschka, Uwe Steglich
IEEE Communications Magazine 52 (2014), no. 2, 178--185.
 
Publications 2013
Γ-Robust Network Design for Mixed-Line-Rate-Planning of Optical Networks  
Svetoslav Duhovnikov, Arie M.C.A. Koster, Manuel Kutschka, Franz Rambach, Dominic Schupke
Proceedings of the National Fiber Optic Engineers Conference (OFC 2013), Optical Society of America (2013), JTh2A.02.
Robust Network Design: Formulations, Valid Inequalities, and Computations  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Networks 61 (2013), no. 2, 128–-149.
A Generic Multi-layer Network Optimization Model with Demand Uncertainty  
Uwe Steglich, T. Bauschert, Christina Büsing, Manuel Kutschka
Advances in Communication Networking - 19th EUNICE/IFIP WG 6.6 International Workshop, Springer (2013), 13-24.
 
Publications 2011
Recoverable Robust Knapsacks: Gamma-Scenarios  
Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka
Proceedings of INOC 2011, International Network Optimization Conference, Springer (2011), 583--588.
Recoverable Robust Knapsacks: the Discrete Scenario Case  
Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka
Optimization Letters 5 (2011), no. 3, 379--392.
An integrated model for survivable network design under demand uncertainty  
Arie M.C.A. Koster, Manuel Kutschka
Design of Reliable Communication Networks (DRCN), 2011 8th International Workshop on the , IEEE Xplore (2011), 54--61 .
Network Design Under Demand Uncertainties: A Case Study on the Abilene and GEANT network data  
Arie M.C.A. Koster, Manuel Kutschka
Tagungsband der 12. ITG-Fachtagung Photonische Netze, VDE Verlag GmbH (2011), 154--161.
Cutset Inequalities for Robust Network Design  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Proceedings of INOC 2011, International Network Optimization Conference, Springer (2011), 118--123.
On the robustness of optimal network designs  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Proceedings IEEE International Conference on Communications, ICC 2011, IEEE Xplore (2011), 1--5.
Robust Network Design: Formulations, Valid Inequalities, and Computations  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Technical Report 11-34, Zuse Institute Berlin (2011).
 
Publications 2010
Recoverable Robust Knapsacks: the Discrete Scenario Case  
Christina Büsing, Arie M.C.A. Koster, Manuel Kutschka
Technical Report 018-2010, Technische Universität Berlin (2010).
Towards Robust Network Design using Integer Linear Programming Techniques  
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack
Proceedings Next Generation Internet, NGI 2010, IEEE Xplore (2010).
 
Publications 2009
Multi-commodity Single Path Routing with submodular bandwidth consumption  
Arie M.C.A. Koster, Manuel Kutschka
Proceedings of INOC 2009 (2009).
Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts  
Arie M.C.A. Koster, A. Zymolka, Manuel Kutschka
Algorithmica 55 (2009), 375--391.
 
Publications 2007
Algorithms to separate ${0,frac{1}{2}}$ Chvátal-Gomory cuts  
Arie M.C.A. Koster, Manuel Kutschka, A. Zymolka
Technical Report 07--10, Zuse Institute Berlin (2007).
Algorithms to separate $\{0,\frac{1}{2}\}$ Chvátal-Gomory cuts  
Arie M.C.A. Koster, A. Zymolka, Manuel Kutschka
Proceedings 15th Annual European Symposium on Algorithms, ESA2007, Springer, Lecture Notes in Computer Science (2007), 693--704.
Algorithmen zur Separierung von ${0,frac{1}{2}}$-Schnitten  
Manuel Kutschka
Master thesis from Technische Universität Berlin (2007).