PhD theses

• Ruobing Shen:
  MILP Formulations for Unsupervised and Interactive Image Segmentation and Denoising
  Dissertation, Universität Heidelberg (2018)
  
  
• Francesco Silvestri}
  Representations of Partition Problems and the Method of Moments
  Dissertation, Universität Heidelberg (2017)
  
  
• Nguyen, Tuan N.
  Solving assignment and routing problems in mixed traffic systems
  Dissertation, Universität Heidelberg (2016)
  
  
• Wiesberg, S.
  Link patterns in complex networks
  Dissertation, Universität Heidelberg (2015)
  
  
• Hildenbrandt, A.
  The Target Visitation Problem
  Dissertation, Universität Heidelberg (2015)
  
  
• Speth, M.
  Exact Solutions for Discrete Grahical Models: Multicuts and reduction Techniques
  Dissertation, Universität Heidelberg (2014)
  
  
• Jung, M.
  Relaxations and Approximations for Mixed-Integer Optimal Control
  Dissertation, Universität Heidelberg (2014)
  
  
• Vo, T.K.
  Exact and Heuristic Solutions to the Bandwidth Minimization Problem
  Dissertation, Universität Heidelberg (2011)
  
  
• Kappes, J.H.
  Inference on Highly-Connected Discrete Graphical Models with Applications to Visual Object Recognition
  Dissertation, Universität Heidelberg (2011)
   
• Bonato, T.
  Contraction-based separation and lifting for solving the max-cut problem
  Dissertation, Universität Heidelberg (2011)
   
• Kirches, C.
  Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
  Dissertation, Universität Heidelberg (2010)
  
  
• Seitz, H.
  Contributions to the Minimum Linear Arrangement Problem
  Dissertation, Universität Heidelberg (2010), Südwestdeutscher Verlag für Hochschulschriften, München
  
  
• Cocking, C.
  Solutions to Facility Location-Network Design Problems
  Dissertation, Universität Heidelberg (2008)
  
  
• Harmsen, S.
  Algorithmic Computer Reconstructions of Stalactite Vaults - Muqarnas - in Islamic Architecture
  Dissertation, Universität Heidelberg (2006)
  
  
• Sager, S.
  Numerical methods for mixed integer optimal control problems
  Dissertation, Universität Heidelberg (2006)
  
  
• Noé, F.
  Transition Networks : Computational Methods for the Comprehensive Analysis of Complex Rearrangements in Proteins
  Dissertation, Universität Heidelberg (2006)
  
  
• Theis, D.O.
  Polyhedra and algorithms for the General Routing Problem
  Dissertation, Universität Heidelberg (2005)
   
• Tran, V.H.
  Solving Large Scale Crew Pairing Problems
  Dissertation, Universität Heidelberg (2005)
  
  
• Ahr, Dino
  Contributions to Multiple Postmen Problems
  Dissertation, Universität Heidelberg (2004)
  
  
• Oswald, M.
  Weighted Consecutive Ones Problems
  Dissertation, Universität Heidelberg, (2003)
  
  
• Wenger, K.M:
  Generic Cut Generation Methods for Routing Problems
  Dissertation, Universität Heidelberg, 2003, Shaker Verlag (2004)
  
  
• Christof, T.
  Low-Dimensional 0/1-Polytopes and Branch-and-Cut in Combinatorial Optimization
  Dissertation, Universität Heidelberg 1997, Shaker Verlag (1997)
  
  
• Funke, M.
  Allgemeine Feedback Vertex Set Probleme
  Dissertation, Uni Heidelberg 1997. Herbert Utz Verlag (1997)