Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

DOI10.1016/J.ORL.2007.05.001zbMath1144.90467OpenAlexW2060761685WikidataQ126239341 ScholiaQ126239341MaRDI QIDQ935238

Ariel Keinan, Refael Hassin

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.001

zbMATH Keywords

traveling salesman problemcheapest insertion heuristicgreedy algorithm with regret

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

A library of local search heuristics for the vehicle routing problem

Cites Work

• Unnamed Item
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

This page was built for publication: Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP