… traveling salesman problem with specified timeframe (mTSPTW). The application of mTSPTW
can be very well seen in the aircraft scheduling problems… SIAM Review, Vol. 33, pp. 60–100…

… For a deep understanding of how algorithms for TSP work, we recommend the book by
Applegate … Finally, for a more general audience we recommend the book by Cook (2011) which …

… The pattern and style of this new book closely resemble those of its … domination analysis
of approximation algorithms and some important variations of the TSP. The purpose of the book …

… good we are in solving hard and large traveling salesman problems. Now they lay out their
views, experience, and findings in this book."—Bert Gerards, … Jan Karel Lenstra, SIAM Review …

… For fifty years the traveling salesman problem has … reviews some of that work as well as
recent developments in techniques that were used on the largest traveling salesman problem …

… traveling salesman problem. The present monograph is meant to be a contribution to practical
traveling salesman problem … We will therefore review some basic definitions from graph …

… The traveling salesman problem has a long history of capturing researchers; we fell under …
the 1949 report by Julia Robinson, “On the Hamiltonian game (a traveling salesman problem)” …

… The traveling salesman problem (TSP) is one of the most studied problems in computational
… For this reason, we first review the recent history of this research area, placing emphasis on …

… The purpose of this paper is to review the existing literature on the mTSP, with an emphasis
on practical applications, integer programming formulations (ILPFs) and solution procedures …

… We consider these algorithms in combination with the Travelling Salesman Problem (TSP).
The TSP objective is to find the shortest route for a travelling salesman who, starting from his …