An improved assignment lower bound for the Euclidean traveling salesman problem
From MaRDI portal
Publication:1058993
DOI10.1016/0167-6377(85)90032-XzbMath0565.90077MaRDI QIDQ1058993
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
lower bound; flow algorithms; Euclidean traveling salesman; improved heuristics; transformation of the distance matrix
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B10: Deterministic network models in operations research
Related Items
A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program, The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching, Better assignment lower bounds for the Euclidean traveling salesman problem
Cites Work