The Traveling Salesman Problem

Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (1995) The Traveling Salesman Problem.
Published in: Network models., Handbooks in operations research and management science. Elsevier 1995, pp. 225-330.

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.


Actions:
Download: [img] PDF - Updated Version
Download (2086Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Collection Item
Citations: 274 (Google Scholar) |
Uncontrolled Keywords: traveling salesman problem
Subjects:
Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
Related URLs:
Deposit Information:
ZAIK Number: zpr92-113
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 04 Nov 2009 00:00
Last Modified: 19 Dec 2011 09:46
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/113