Convergent Duality for the Traveling Salesman Problem
Name
OR-204-89.pdf
Size
858.81 KB
Format
Adobe PDF
Checksum (MD5)
f202350c079c87c9c9f05373bb29f12d
Author(s)
Shapiro, Jeremy F., 1939-
Date Issued
November 1989
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 204-89
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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
