| Article ID: | iaor2010170 |
| Volume: | 19 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 15 |
| Publication Date: | Jan 2010 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Sourd Francis |
A variant of the Euclidean traveling salesman problem (TSP) is defined and studied. In the three-dimensional space, the objective function is to lexicographically minimize the