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

A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the ...

A salesman has to visit every major city in the U.S. What is the cheapest way to hit them all exactly once and then return to the headquarters? The computation of the single best answer for what is ...

Dr. James McCaffrey of Microsoft Research uses full code samples to detail an evolutionary algorithm technique that apparently hasn't been published before. The goal of a combinatorial optimization ...