Universität zu Köln

Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Thienel, Stefan (1994). Provably good solutions for the traveling salesman problem. Physica-Verl.. ["eprint_fieldopt_monograph_type_preprint" not defined].

Preview

PDF zpr92-114.pdf Download (425kB) | Preview

Abstract

The determination of true optimum solutions of combinatorial optimization problems is seldomly required in practical applications. The majority of users of optimization software would be satisfied with solutions of guaranteed quality in the sense that it can be proven that the given solution is at most a few percent off an optimum solution. This paper presents a general framework for practical problem solving with emphasis on this aspect. A detailed discussion along with a report about extensive computational experiments is given for the traveling salesman problem.

Item Type:	Preprints, Working Papers or Reports (["eprint_fieldopt_monograph_type_preprint" not defined])
Creators:	Creators Email ORCID ORCID Put Code Jünger, Michael UNSPECIFIED UNSPECIFIED UNSPECIFIED Reinelt, Gerhard UNSPECIFIED orcid.org/0000-0002-7193-501X UNSPECIFIED Thienel, Stefan UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-546729
Journal or Publication Title:	Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research
Volume:	40
Number:	2
Page Range:	pp. 183-217
Date:	1994
Publisher:	Physica-Verl.
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/54672