Manuel Kutschka

According to our database1, Manuel Kutschka authored at least 16 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Formulations and algorithms for the recoverable Γ-robust knapsack problem.
EURO J. Comput. Optim., 2019

2015
Robust Metric Inequalities for Network Loading Under Demand Uncertainty.
Asia Pac. J. Oper. Res., 2015

2014
Network planning under demand uncertainty with robust optimization.
IEEE Commun. Mag., 2014

An Insight to Aviation: Rostering Ground Personnel in Practice.
Proceedings of the Operations Research Proceedings 2014, 2014

Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Robust network design: Formulations, valid inequalities, and computations.
Networks, 2013

Γ-robust network design for Mixed-Line-Rate-Planning of Optical Networks.
Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

A Generic Multi-layer Network Optimization Model with Demand Uncertainty.
Proceedings of the Advances in Communication Networking, 2013

2011
Recoverable robust knapsacks: the discrete scenario case.
Optim. Lett., 2011

Cutset Inequalities for Robust Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011

Recoverable Robust Knapsacks: Γ-Scenarios.
Proceedings of the Network Optimization - 5th International Conference, 2011

On the Robustness of Optimal Network Designs.
Proceedings of IEEE International Conference on Communications, 2011

An integrated model for survivable network design under demand uncertainty.
Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011

2010
Towards robust network design using integer linear programming techniques.
Proceedings of the Next Generation Internet (NGI), 2010

2009
Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.
Algorithmica, 2009

2007
Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts.
Proceedings of the Algorithms, 2007


  Loading...