Bibliographie

1

Darrell Whitley. - A Genetic Algorithm Tutorial, Computer Science Departement, Colorado State University

2

Thomas Cormen, Charles Leiserson, Ronald Rivest. - «Introduction à l'algorithmique», Dunod

3

G.B. Dantzig, R. Fulkerson, S.Johnson, «Solution of a large-scale traveling salesman problem», Operations Research 2 (1954), 393-410

4

D. Applegate, R. Bixby, V. Chvàtal, W. Cook,«Finding cuts in the TSP(A preliminary report)»,1995

5

M. Held, R. M. Karp, «The Traveling Salesman Problem and Minimum Spanning Trees», 1970

6

S. Lin, B.W. Kernighan, «An Effective Heuristic Algorithm for the Traveling Salesman Problem», 1973

7

Keld Helsgaun, «An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic», 2000

8

H. Kargupta,«SEARCH, polynomial complexity, and the fast messy genetic algorithm», 1995

9

J. C. «Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing», 1994

10

F. Glover, M. Laguna, «Tabu search», Kluwer Academic Publishers, 1997