Provably good solutions for the traveling salesman problem

Provably good solutions for the traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor19952301
Country: Germany
Volume: 40
Start Page Number: 183
End Page Number: 217
Publication Date: Jan 1994
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: , ,
Abstract:

The determination of true optimum solutions of combinatorial optimization problems is seldom 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.

Reviews

Required fields are marked *. Your email address will not be published.