Convergent duality for the traveling salesman problem

A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group-theoretic and Lagrangean relaxation constructions.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 10; no. 3; pp. 129 - 136
Main Author Shapiro, Jeremy F.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 1991
Elsevier
Subjects
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
generalized linear programming
group theory
Lagrangean relaxation
Operational research and scientific management
Operational research. Management science
shortest route problem
Traveling Salesman Problem
group theory
Lagrangean relaxation
shortest route problem
Traveling Salesman Problem
generalized linear programming
Combinatory problem
Group theory
Travelling salesman problem
Relaxation method
Linear programming
Duality
Lagrangian method
Online AccessGet full text

Cover

More Information
Summary:A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group-theoretic and Lagrangean relaxation constructions.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(91)90029-O