The traveling salesman problem: A duality approach

DOI10.1007/BF01584338zbMath0377.90092MaRDI QIDQ4156164

Jamie J. Goode, Mokhtar S. Bazaraa

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (5)

The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm ⋮ On the quadratic assignment problem ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem ⋮ Transforming asymmetric into symmetric traveling salesman problems

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Note—On the Use of Fictitious Bounds in Tree Search Algorithms
• Validation of subgradient optimization
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: The traveling salesman problem: A duality approach