The dragon war

DOI10.1016/j.amc.2006.08.019zbMath1185.90175OpenAlexW1963548995MaRDI QIDQ876681

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) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Solution of large-scale symmetric travelling salesman problems
• On the solution of traveling salesman problems
• Unnamed Item
• Unnamed Item

This page was built for publication: The dragon war