Heuristics and bounds for the travelling salesman location problem on the plane

DOI10.1016/0167-6377(87)90056-3zbMath0637.90032OpenAlexW2071624957MaRDI QIDQ1099066

Oded Berman, David Simchi-Levi

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90056-3

zbMATH Keywords

heuristicsworst-case analysispolynomial heuristicsrectilinear or Euclidean distancestravelling salesman location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (3)

Location-routing: issues, models and methods ⋮ Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic optimization: The Fermat-Weber location problem
• The power of geometric duality
• One-facility location with rectilinear tour distances
• Minisum location of a traveling salesman
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• Local convergence in Fermat's problem
• Hamilton Paths in Grid Graphs
• A note on Fermat's problem

This page was built for publication: Heuristics and bounds for the travelling salesman location problem on the plane