The goal of a combinatorial optimization problem is to find a set of distinct integer values that minimizes some cost function. The most famous example is the Traveling Salesman Problem (TSP). There ...

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 ...

One small amoeba found a solution to the traveling salesman problem faster than our best algorithms. What does it know that we don't? One of the oldest problems in computer science was just solved by ...