A note on dual solutions of the assignment problem in connection with the traveling salesman problem

DOI10.1016/0377-2217(90)90251-6zbMath0697.90048OpenAlexW2088563432MaRDI QIDQ911984

Bernd Jeromin, Frank Koerner

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90251-6

zbMATH Keywords

lower boundtravelling salesmansubgradients

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On dual solutions of the linear assignment problem
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
• Identification of non-optimal arcs for the traveling salesman problem
• Improving Christofides' lower bound for the traveling salesman problem
• Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems
• Technical Note—Bounds for the Travelling-Salesman Problem

This page was built for publication: A note on dual solutions of the assignment problem in connection with the traveling salesman problem