
 TSPBIB Home Page 
  A study of complexity transitions on the asymmetric traveling salesman problem, by W. Zhang and R.E. Korf. 
  The traveling salesman problem, by V. Chvatal, who is one of the authors of a computer code that solved more than twenty previously unsolved instances. 
  Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighbourhood, by R.E. Burkard and V.G. Deineko, Technische Universität Graz, SFBReport 1, July 1994. 
 www.densis.fee.unicamp.br /~moscato/TSPBIB_home.html (5518 words) 
