Some properties of the solution space of the N-city traveling-salesman problem

DOI10.1016/0096-3003(87)90059-2zbMath0633.90086OpenAlexW2087736400MaRDI QIDQ1096547

Bruce R. Feiring

Publication date: 1987

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(87)90059-2

zbMATH Keywords

group representationsubtour eliminationorthogonality conditiontraveling-salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items

Tours for the traveling salesman

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item