Aristide Mingozzi, Lucio Bianco, Salvatore Ricciardelli, Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints, Operations Research, Vol. 45, No ...

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

View on Coursera Course Description This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving ...

The task is the long-standing challenge known as the traveling salesman problem, or TSP for short. Finding a method that can quickly solve every example of the TSP would be a stunning breakthrough ...