| Article ID: | iaor20091419 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 243 |
| End Page Number: | 246 |
| Publication Date: | Mar 2008 |
| Journal: | Operations Research Letters |
| Authors: | Hassin Refael, Keinan Ariel |
| Keywords: | heuristics |
We consider greedy algorithms that allow partial regret. As an example we consider a variant of the cheapest insertion algorithm for the TSP. Our numerical study indicates that in most cases it significantly reduces the relative error, and the added computational time is quite small.