Combinatorial optimization problems are problems that arise in everyday situations, involving the puzzle of determining the shortest route that can be taken between multiple points. Researchers have ...

It’s a problem that sounds simple, but the best minds in mathematics have puzzled over it for generations: A salesman wants to hawk his wares in several cities and return home when he’s done. If he’s ...

Nathan Klein receives funding from the National Science Foundation. Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...