members & address research industrial partners teaching publications gallery home page of the group
    clickable logo

Combinatorial Optimization & Graph Algorithms

TU logo

contents
.

department
 .  group
 .  .  members & address
 .  .  research
 .  .  .  network flows
 .  .  .  scheduling
 .  .  .  online
 .  .  .  computational integer programming
 .  .  . routing
 .  .  .  .  disjoint routing
 .  .  .  .  wham
 .  .  publications
 .  .  cooperation with industry
 .  .  teaching
 .  .  project gallery
 .  .  events
 .  .  internals
 .  .  search

Routing Problems

Routing problems concern the design of routes in a metric space or network. There exist a huge variety of routing problems. The probably most classic one is the Traveling Salesman Problem (TSP) which consists of determining a shortest Hamiltonian circuit or cycle in a graph. Applications of the TSP and routing in general arise in distribution management, in scheduling and in manufacturing.


More detailed information on our work on routing problems:

top top
source last modified: Fri Aug 13 2004, last built: Thu Aug 26 2004
Nicole Megow <nmegow@math.TU-Berlin.DE>
Validate HTML