Convergent duality for the traveling salesman problem

DOI10.1016/0167-6377(91)90029-OzbMath0744.90073MaRDI QIDQ1178716

Jeremy F. Shapiro

Publication date: 26 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Lagrangean relaxationgroup theoryTraveling Salesmansequence of shortest route problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Combinatorial optimization (90C27) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• Generalized Linear Programming Solves the Dual
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• A Convergent Duality Theory for Integer Programming
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

This page was built for publication: Convergent duality for the traveling salesman problem