A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem
Sign Up to like & getrecommendations! Published in 2025 at "Networks"
DOI: 10.1002/net.70012
Abstract: Nearest, Farthest, and Cheapest Insertion are three well‐known polynomial‐time approximation algorithms for the Traveling Salesman Problem (TSP). This paper aims to report on a fourth insertion algorithm, called Largest Insertion, from both a theoretical and… read more here.
Keywords: traveling salesman; salesman problem; largest insertion; insertion algorithm ... See more keywords