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. Key Words: Traveling Salesman Problem, Lagrangean relaxation, shortest route problem, genera...
Main Author: | Shapiro, Jeremy F., 1939- |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5199 |
Similar Items
-
The Travelling Salesman Problem and Related Problems
by: Gavish, Bezalel, et al.
Published: (2004) -
Traveling salesman path problems
by: Lam, Fumei
Published: (2006) -
Probabilistic Traveling Salesman Problems
by: Jaillet, Patrick
Published: (2005) -
An algorithm for the traveling salesman problem,
by: Little, John D. C.
Published: (2009) -
Constructive Duality in Integer Programming
by: Fisher, Marshall L., et al.
Published: (2004)