Convergent Duality for the Traveling Salesman Problem
Author(s)Shapiro, Jeremy F., 1939-
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.
Massachusetts Institute of Technology, Operations Research Center
Operations Research Center Working Paper;OR 204-89