 | Monter d'un niveau |
Anily, S., Bramel, J., & Hertz, A. (1999). A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. Operations Research Letters, 24(1-2), 29-35. Lien externe
Anily, S., Gendreau, M., & Laporte, G. (1999). The Swapping Problem on a Line. SIAM Journal on Computing, 29(1), 327-335. Lien externe
