A minimum spanning tree based heuristic for the travelling salesman tour

DOI10.1007/s12597-017-0318-5zbMath1391.90522OpenAlexW2613176386MaRDI QIDQ724377

Santosh Kumar, 'Maseka Lesaoana, Philimon Nyamugure, Elias Munapo

Publication date: 25 July 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-017-0318-5

zbMATH Keywords

connected networkminimum spanning tree pathtravelling salesman tour

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

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

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• 8/7-approximation algorithm for (1,2)-TSP
• Heuristic analysis, linear programming and branch and bound
• A self-organising model for the travelling salesman problem
• The Shortest Connected Graph Through Dynamic Programming Technique

This page was built for publication: A minimum spanning tree based heuristic for the travelling salesman tour