The dragon war

DOI10.1016/J.AMC.2006.08.019zbMATH Open1185.90175OpenAlexW1963548995MaRDI QIDQ876681FDOQ876681

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the solution of traveling salesman problems
• Solution of large-scale symmetric travelling salesman problems

Cited In (2)

• Title not available (Why is that?)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)