| Article ID: | iaor20061846 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 106 |
| End Page Number: | 110 |
| Publication Date: | Jan 2006 |
| Journal: | Operations Research Letters |
| Authors: | Woeginger Gerhard J., Okamoto Yoshio, Deineko Vladimir G., Hoffman Michael |
We propose two algorithms for the planar Euclidean traveling salesman problem. The first runs in