Lexicographically minimizing axial motions for the Euclidean TSP - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2010

Lexicographically minimizing axial motions for the Euclidean TSP

Résumé

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 x-moves, then the y-moves and finally the z-moves. The 2D and 3D cases are first studied and solved as a shortest path problem. Then the approach is generalized to the d-dimensional case.

Dates et versions

hal-01185192 , version 1 (19-08-2015)

Identifiants

Citer

Francis Sourd. Lexicographically minimizing axial motions for the Euclidean TSP. Journal of Combinatorial Optimization, 2010, 19 (1), pp.1-15. ⟨10.1007/s10878-008-9154-0⟩. ⟨hal-01185192⟩
30 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More