Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Rinaldi, Giovanni (1995). The Traveling Salesman Problem. Elsevier. ['eprint_fieldopt_monograph_type_preprint' not defined].

[thumbnail of rep-92.113-koeln.pdf]
Preview
 PDF
rep-92.113-koeln.pdf
Download (2MB) | Preview

Abstract

This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances. Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances.

Item Type: Monograph (['eprint_fieldopt_monograph_type_preprint' not defined])
Creators:
Creators
Email
ORCID
ORCID Put Code
Jünger, Michael
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Reinelt, Gerhard
UNSPECIFIED
https://orcid.org/0000-0002-7193-501X
UNSPECIFIED
Rinaldi, Giovanni
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-546710
Series Name: Handbooks in operations research and management science
Number: 7
Page Range: pp. 225-330
Date: 1995
Publisher: Elsevier
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54671

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item