1. , , , Finding cuts in the TSP (a preliminary report), Technical report 95-05 ( 1995), DIMACS, Rutgers University, New Brunswick, NJ.
2. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
3. , , , Concorde Available at http://www.tsp.gatech.edu//concorde.html 2004.
4. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, PhD Thesis, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, 1996.