A note on the traveling salesman problem

DOI10.1016/0167-6377(89)90004-7zbMath0665.90094OpenAlexW2011993797MaRDI QIDQ1116903

S. H. Smith

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90004-7

zbMATH Keywords

complexitytraveling salesmansubtour relaxation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05)

Related Items (1)

Polarity and the complexity of the shooting experiment

Cites Work

• Unnamed Item
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
• The Planar Hamiltonian Circuit Problem is NP-Complete

This page was built for publication: A note on the traveling salesman problem