The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...