Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:library.tue.nl:455006

Well-solvable special cases of the TSP : a survey

Authors
Publication date
1 January 1996
Publisher
Technische Universiteit Eindhoven

Abstract

The Traveling Salesman Problem belongs to the most important and most investigated problems in combinatorial optimization. Although it is an NP-hard problem, many of its special cases can be solved efficiently. We survey these special cases with emphasis on results obtained during the decade 1985-1995. This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler and Shmoys. Keywords: Traveling Salesman Problem, Combinatorial optimization, Polynomial time algorithm, Computational complexity

Similar works

Full text

thumbnail-image

Repository TU/e

redirect
oaioai:library.tue.nl:455006
Last time updated on 12/11/2016

This paper was published in Repository TU/e.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.