Traveling Salesman Problems and Extensions
The Traveling Salesman Problem (TSP) is one of the most widely studied combinatorial optimization problems. While its statement is deceptively simple, it remains one of the most challenging problems in operations research. Hundreds of articles have been written on the problem. The book edited by Lawler et al. (1985) provides an insightful and comprehensive survey of major research results until that date. The purpose of this chapter is present some exact and approximate algorithms for the traveling salesman problem.
KeywordsExpense Malone Balas
Unable to display preview. Download preview PDF.