The dragon war

DOI10.1016/J.AMC.2006.08.019MaRDI QIDQ876681zbMATH OpenOpenAlexFDO

Authors Joachim Mertz

Publication date 26 April 2007

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

Full work available at URL https://doi.org/10.1016/j.amc.2006.08.019

zbMATH Keywords

NP-completenesstravelling salesman problemdiscrete optimisationcutting plane optimisationP/NP problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 795217
• A method for solving traveling-salesman problems
• A cutting plane procedure for the travelling salesman problem on road networks
• The traveling salesman problem. II: Exact methods
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• On the solution of traveling salesman problems
• Solution of large-scale symmetric travelling salesman problems

Cited in

(4)

• scientific article; zbMATH DE number 1202559 (Why is no real title available?)
• A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
• Traveling salesman problem at the post of Slovenia

This page was built for publication: The dragon war

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876681)