Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity

DOI10.1007/978-3-030-33585-4_26zbMath1462.90110OpenAlexW2982008354MaRDI QIDQ5117306

Elias Munapo

Publication date: 20 August 2020

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-33585-4_26

zbMATH Keywords

linear programmingspanning treetraveling salesman problemunimodularinterior point algorithmsub-tours

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interior point methods 25 years later
• A minimum spanning tree based heuristic for the travelling salesman tour
• The traveling salesman problem and its variations.
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• 8/7-approximation algorithm for (1,2)-TSP
• In Pursuit of the Traveling Salesman

This page was built for publication: Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity