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.

Projects: