Current PhD Students

Timo Berthold Gerald Gamrath Ambros Gleixner Stefan Heinz Olga Heismann
Jesco Humpola Marika Karbstein Torsten Klug Matthias Miltenberger Jonad Pulaj
Christian Raack Markus Reuther Elmar Swarat Annie Raymond Robert Schwarz
Jonas Schweiger Kati Wolter      


Former PhD Students

Technische Universität Berlin (1991 - 2011)
  1. Schlechte, Thomas:  
    Railway Track Allocation: Models and Algorithms, 2011
     
  2. Cardonha, Carlos Henrique:  
    Applied Methods for the Vehicle Positioning Problem, 2011
     
  3. Tuchscherer, Andreas:  
    Local Evaluation of Policies for Discounted Markov Decision Problems, 2010
     
  4. Hoàng, Nam Dũng:  
    Algorithmic Cost Allocation Games: Theory and Applications, 2010
    (Dissertation Prize 2011 of the Gesellschaft für Operations Research (GOR))
     
  5. Hiller, Benjamin:  
    Online Optimization: Probabilistic Analysis and Algorithm Engineering, 2009
    (Dissertation Prize 2010 of the Gesellschaft für Operations Research (GOR))
     
  6. Stephan, Rüdiger:  
    Polyhedral Aspects of Cardinality Constrained Combinatorial Optimization Problems, 2009
     
  7. Orlowski, Sebastian:  
    Optimal Design of Survivable Multi-layer Telecommunication Networks, 2009
     
  8. Geerdes, Hans-Florian:  
    UMTS Radio Network Planning:
    Mastering Cell Coupling for Capacity Optimization
    , 2008
    (Dissertationspreis 2008 der von der Gesellschaft für Informatik (GI) und der Informationstechnischen Gesellschaft (ITG) gemeinsam getragenen Fachgruppe "Kommunikation und Verteilte Systeme")
     
  9. Achterberg, Tobias:  
    Constraint Integer Programming, 2007
    (Dissertation Prize 2008 of the Gesellschaft für Operations Research (GOR) and George B. Dantzig Dissertation Award 2008
    of the Institute of Operations Research and the Management Sciences (INFORMS), 2nd prize)
     
  10. Harks, Tobias:  
    Multicommodity Routing Problems
    Selfish Behavior and Online Aspects
    , 2007
     
  11. Weider, Steffen:  
    Integration of Vehicle and Duty Scheduling in Public Transport, 2007
     
  12. Bley, Andreas:  
    Routing and Capacity Optimization for IP Networks, 2007
    (awarded with the Dissertation Prize 2007 of the Gesellschaft für Operations Research and the INFORMS Doctoral Dissertation Award for Operations Research in Telecommunications 2008)
     
  13. Zymolka, Adrian:  
    Design of Survivable Optical Networks by Mathematical Optimization, 2006
     
  14. Lutz-Westphal, Brigitte:  
    Kombinatorische Optimierung - Inhalte und Methoden für einen authentischen Mathematikunterricht, 2006
     
  15. Bosse, Hartwig:  
    Representing polyhedra by few polynomial inequalities, 2005
     
  16. Marenco, Javier L.:  
    Chromatic Scheduling Polytopes Coming from the Bandwidth Allocation Problem in Point-to-Multipoint Radio Access Systems, (PhD at Departamento de Computación, Universidad de Buenos Aires, Buenos Aires, Argentina; jointly supervised with Annegret Wagler), 2005
     
  17. Koch, Thorsten:  
    Rapid Mathematical Programming, 2004
    (awarded with the Dissertation Prize 2005 of the Gesellschaft für Operations Research)

     
  18. Torres Carvajal, Luis Miguel:  
    Online Vehicle Routing, 2003
     
  19. Poensgen, Diana: 
    Facets of Online Optimization
    Online Dial-a-Ride Problems and Dynamic Configuration of All-Optical Networks
    , 2003
     
  20. Eisenblätter, Andreas: 
    Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds, 2001
    (awarded with the INFORMS Telecommunications Dissertation Award and the Dissertation Prize of the Gesellschaft für Operations Research 2002)
    published: ISBN: 3-89873-213-4, pp. 248, Cuvillier-Verlag, Göttingen, 2002

     
  21. Wessäly, Roland:   
    DImensioning Survivable Capacitated NETworks, 2000
    (awarded with the Mannesmann-Innovationspreis)
    published: ISBN: 3-89712-864-0, pp. 200, Cuvillier-Verlag, Göttingen, 2000
     
  22. Wagler, Annegret:    
    Critical Edges in Perfect Graphs, 2000
    published: ISBN: 3-89712-953-1, pp. 128, Cuvillier-Verlag, Göttingen, 2000
     
  23. Stolle, Hermann:   
    Mathematische Modellierung und Lösung von Optimierungsproblemen bei der Planung von Telefonnetzen, 2000
     
  24. Borndörfer, Ralf:   
    Aspects of Set Packing, Partitioning and Covering, 1998
    (awarded with the Joachim-Tiburtius-Preis 1999 and the Dissertation Prize of the Gesellschaft für Operations Research 2000)

    published: ISBN: 3-8265-4351-3, pp. 223, Shaker-Verlag, 1998
     
  25. Urbaniak, Regina:   
    Decomposition of Generating Sets and of Integer Programs, 1998
     
  26. Kamin, Nicola:    
    On-Line Optimization of Order Picking in an Automated Warehouse,1998
    published: ISBN: 3-8265-3556-1, pp. 264, Shaker-Verlag, 1998
     
  27. Löbel, Andreas:   
    Optimal Vehicle Scheduling in Public Transit, 1997
    published: ISBN-10: 3-8265-3504-9, ISBN-13: 978-3-8265-3504-8,
    pp. 188, Shaker-Verlag, 1998

     
  28. Wunderling, Roland:  
    Paralleler und Objektorientierter Simplex-Algorithmus, 1997
     
  29. Ascheuer, Norbert:   
    Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing System, 1995
     
  30. Abdel-Aziz, Atef:   
    Combinatorial Optimization Problems Arising in the Design and Management of an Automatic Storage System, 1994
     
  31. Ferreira, Carlos:   
    On Combinatorial Optimization Problems Arising in Computer System Design, 1994
     
  32. Martin, Alexander:  
    Packen von Steinerbäumen: Polyedrische Studien und Anwendung, 1992
     
  33. Weismantel,Robert:   
    Plazieren von Zellen: Theorie und Lösung eines quadratischen 0/1 Optimierungsproblems, 1992
    (awarded with the Carl-Ramsauer-Preis of the AEG-Aktiengesellschaft)

     
  34. Stoer, Mechthild:  
    Design of survivable networks, 1991
    (awarded with the dissertation prize of the Gesellschaft für Mathematik, Ökonomie und Operations Research) 

     

Universität Augsburg (1983 -1987)

  1. Zaw Win:    
    Contributions to Routing Problems, 1987
     
  2. Zehendner, Eberhard:  
    Methoden der Polyedertheorie zur Herleitung von oberen Schranken für die Mächtigkeit von Block-Codes, 1986
     
  3. Wakabayashi,Yoshiko:   
    Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations, 1986
     
  4. Reinelt,Gerhard:   
    The Linear Ordering Problem: Algorithms and Applications, 1984
    (awarded with the dissertation prize of the University of Augsburg),

     
  5. Jünger, Michael:   
    Polyhedral Combinatorics and the Acyclic Subdigraph Problem, 1983
     

 
 

URL: http://www.zib.de/groetschel/students/doctoralstudents.html
mailto: Pagemaster    09/02/2012  17:42

Valid HTML 4.01!   CSS ist valide!