==========================================================================

  Documentation of modifications of the library

==========================================================================

---------------------------------------
Changes from Version 1.0 to Version 1.1
---------------------------------------

-  The format entry for asymmetric traveling salesman problems was added.

-  The possiblity to require edges in the solution was introduced.

-  The original Hamiltonian path version of the 318-city problem by 
   Lin/Kernighan was added explicitly as linhp318.tsp.

-  The crystallography problems by Bland/Shallcross are included.

---------------------------------------
Changes from Version 1.1 to Version 1.2
---------------------------------------

-  The symmetric TSPs burma14, ts225, brazil58, and swiss42 are added.
   Contributors are Zaw Win, M.Juenger, C.Ferreira and F.Fricker.

-  Some large instances on cities in Germany were provided by A Bachem 
   and M.Wottawa from the university of Cologne. The instances are 
   d18512, fnl4461, nrw1379, and brd14051.

-  D.S.Johnson provided three large problems arising in
   programmed laser logic (pla33810, pla7397, and pla85900).
   A new distance function was necessary for these problems. It is
   denoted by CEIL_2D and gives the ceiling of the Euclidean metric.

-  The first six instances of asymmetric traveling salesman problems
   could be included. They were made available by M.Fischetti and
   B.Repetto. The instances are ft53, ft70, br17, kro124p, ry48p, and p43.
