Convergent Duality for the Traveling Salesman Problem

Author(s)
Shapiro, Jeremy F., 1939-
Thumbnail
DownloadOR-204-89.pdf (858.8Kb)
Metadata
Show full item record
Abstract
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. Key Words: Traveling Salesman Problem, Lagrangean relaxation, shortest route problem, generalized linear programming, group theory.
Date issued
1989-11
URI
http://hdl.handle.net/1721.1/5199
Department
Massachusetts Institute of Technology. Operations Research Center
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 204-89
Collections