Discrete and
Combinatorial Optimization
Home
People
Teaching
Publications
Projects
Software and Data
Conferences
Literature
Contact
Open positions
Internships / PhD studies / Postdoc positions
Diverses
Internal
Projects
Traveling Salesman Problem
Traveling Salesman Problem
Polyhedral theory and algorithms for the Graphical TSP
Small Instance Relaxations for the TSP
Efficient CACTUS Construction
Routing
Rural Postman Problem (a.k.a. General Routing Problem)
Capacitated Vehicle Routing
Chinese Postman Problems
Scheduling
Airline Crew Scheduling
Order and permutation
Linear Ordering
Linear Arrangement Problem
Bandwidth Minimization
Combinatorial Optimization in biology and physics
Physical Mapping Problem
Max-Cut-Problem
Facility Location
Improving Facility Access
Links
Institut für Informatik
Fakultät für Mathematik und Informatik
Interdisziplinäres Zentrum für wissenschaftliches Rechnen
Universität Heidelberg
Weitere Links