1. The traveling salesman problem with delivery and backhauls
2. and Special session on tsp, 15th Int Symp on Mathematical Programming, University of Michigan, 1994.
3. and Finding cuts in the tsp, Technical report 95-05, DIMACS, 1995.
4. and Concorde: A code for solving traveling salesman problems, World Wide Web, http://www.math.princeton.edu/tsp/concorde.html, 2001.
5. and Computational results with a branch and cut code for the capacitated vehicle routing problem, Technical report 1 RR949-M, ARTEMIS-IMAG, Grenoble France, 1995.