An improved assignment lower bound for the Euclidean traveling salesman problem

DOI10.1016/0167-6377(85)90032-XzbMath0565.90077MaRDI QIDQ1058993

William R. jun. Stewart

Publication date: 1985

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

zbMATH Keywords

lower boundflow algorithmsEuclidean traveling salesmanimproved heuristicstransformation of the distance matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (3)

The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching ⋮ A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program ⋮ Better assignment lower bounds for the Euclidean traveling salesman problem

Cites Work

• Unnamed Item
• Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• The Traveling-Salesman Problem
• A man-machine approach toward solving the traveling salesman problem

This page was built for publication: An improved assignment lower bound for the Euclidean traveling salesman problem