We propose a dynamic traveling salesman problem (TSP) with stochastic arc costs motivated by applications, such as dynamic vehicle routing, in which the cost of a decision is known only ...

Determining the precise integrality gap for the subtour linear programming (LP) relaxation of the traveling salesman problem is a significant open question, with little progress made in thirty years ...

The most efficient path that visits each of 2 million stars just once We have found the best path to take between the stars. The travelling salesman problem, an infamous mathematical puzzle that ...