Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
type: Item
instance of: scholarly article
title: Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
zbMATH Open document ID: 1144.90467
author: Refael Hassin
author: Ariel Keinan
published in: Operations Research Letters
publication date: 2008-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5306952
zbMATH Keywords: cheapest insertion heuristic
zbMATH Keywords: greedy algorithm with regret
zbMATH Keywords: traveling salesman problem
MaRDI profile type: Publication
full work available at URL: j.orl.2007.05.001
OpenAlex ID: W2060761685
cites work: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
cites work: Q3693290
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
Wikidata QID: Q126239341
DOI: 10.1016/J.ORL.2007.05.001
description: scientific article; zbMATH DE number 5306952