Chapitre 11 • Métaheuristiques en optimisation combinatoire
418
[DeWe90] D. De Werra, “Heuristics for graph coloring”, Computing Suppl., Vol. 7, p. 191208, 1990.
[Dori91] A. Colorni, M. Dorigo, V. Maniezzo, “Distributed Optimization by Ant Colo nies”,
Proceedings of the European Conference on Artificial Life ECAL’91, p. 134-142. Elsevier
Publishing, 1991.
[Glov77] F. Glover, “Heuristics for integer programming using surrogate constraints”,
Decision Science, Vol. 8, p. 156-166, 1977.
[Glov86] F. Glover, “Future paths for integer programming and links to artificial intel li -
gence”, Computers and Operations Research, Vol. 5, p. 533-549, 1986.
[Glov97] F. Glover, M. Laguna, “Tabu Search”, Kluwer Academic Publishers, 1997.
[Gold94] D.E. Goldberg, “Algo rithmes géné tiques. Explo ra tion, opti mi sation et appren tis
sage auto ma tique”, Addison- Wesley France, 1994.
[Hans86] P. Hansen, “The steepest ascent mildest descent heuristic for combinatorial
programming”, Congress on Numerical Methods in Combinatorial Programming, Capri,
Italy, 1986.
[Holl75] J.H. Holland, “Adap ta tion in natural and artificial systems”, Ann Arbor : The
University of Michigan Press, 1975.
[Holl92] J.H. Holland, “Les algo rithmes géné tiques”, Pour la Science, N° 179, p. 44-51,
sep tembre 1992.
[Kirk83] S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, “Optimization by simulated annealing”,
Science, Vol. 220, N° 4598, p. 671-680, 1983.
[Pirl92] M. Pirlot, “General local search heuristics in Combinatorial Optimization : a
tutorial”, Belgian Jour nal of Operations Research, Statistics and Com pu ter Science,
Vol. 32, p. 8-67, 1992.
[Reev95] C.R. Reeves, ed., “Modern Heuristic Tech niques for Combinatorial Problems”,
Advances topics in com pu ter science series, Mc Graw- Hill, 1995.
[Rend96] J.M. Renders, S.P. Flasse, “Hybrid methods using genetic algorithms for glo bal
optimization”, IEEE Trans. on Systems, Man, and Cybernetics – Part B : Cybernetics,
Vol. 26, N° 2, 1996.
[Siar89] P. Siarry, G. Dreyfus, “La méthode du recuit simulé : théo rie et appli ca tions”,
Ouvrage de syn thèse, Editeur : ESPCI – IDSET, 10 rue Vauquelin, 75005 Paris, 1989.
[Sori97] P. Soriano, M. Gendreau, “Fon de ments et appli ca tions des méthodes de recherche
avec tabous”, Recherche opé ra tion nelle / Operations Research, Vol. 31, N° 2, p. 133-159,
1997.
[VanL87] P.J.M. Van Laarhoven, E.H.L. A arts, “Simulated annealing : theory and appli ca -
tions”, D. Reidel Publishing Company, Dordrecht (The Netherlands), 1987.
418
[DeWe90] D. De Werra, “Heuristics for graph coloring”, Computing Suppl., Vol. 7, p. 191208, 1990.
[Dori91] A. Colorni, M. Dorigo, V. Maniezzo, “Distributed Optimization by Ant Colo nies”,
Proceedings of the European Conference on Artificial Life ECAL’91, p. 134-142. Elsevier
Publishing, 1991.
[Glov77] F. Glover, “Heuristics for integer programming using surrogate constraints”,
Decision Science, Vol. 8, p. 156-166, 1977.
[Glov86] F. Glover, “Future paths for integer programming and links to artificial intel li -
gence”, Computers and Operations Research, Vol. 5, p. 533-549, 1986.
[Glov97] F. Glover, M. Laguna, “Tabu Search”, Kluwer Academic Publishers, 1997.
[Gold94] D.E. Goldberg, “Algo rithmes géné tiques. Explo ra tion, opti mi sation et appren tis
sage auto ma tique”, Addison- Wesley France, 1994.
[Hans86] P. Hansen, “The steepest ascent mildest descent heuristic for combinatorial
programming”, Congress on Numerical Methods in Combinatorial Programming, Capri,
Italy, 1986.
[Holl75] J.H. Holland, “Adap ta tion in natural and artificial systems”, Ann Arbor : The
University of Michigan Press, 1975.
[Holl92] J.H. Holland, “Les algo rithmes géné tiques”, Pour la Science, N° 179, p. 44-51,
sep tembre 1992.
[Kirk83] S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, “Optimization by simulated annealing”,
Science, Vol. 220, N° 4598, p. 671-680, 1983.
[Pirl92] M. Pirlot, “General local search heuristics in Combinatorial Optimization : a
tutorial”, Belgian Jour nal of Operations Research, Statistics and Com pu ter Science,
Vol. 32, p. 8-67, 1992.
[Reev95] C.R. Reeves, ed., “Modern Heuristic Tech niques for Combinatorial Problems”,
Advances topics in com pu ter science series, Mc Graw- Hill, 1995.
[Rend96] J.M. Renders, S.P. Flasse, “Hybrid methods using genetic algorithms for glo bal
optimization”, IEEE Trans. on Systems, Man, and Cybernetics – Part B : Cybernetics,
Vol. 26, N° 2, 1996.
[Siar89] P. Siarry, G. Dreyfus, “La méthode du recuit simulé : théo rie et appli ca tions”,
Ouvrage de syn thèse, Editeur : ESPCI – IDSET, 10 rue Vauquelin, 75005 Paris, 1989.
[Sori97] P. Soriano, M. Gendreau, “Fon de ments et appli ca tions des méthodes de recherche
avec tabous”, Recherche opé ra tion nelle / Operations Research, Vol. 31, N° 2, p. 133-159,
1997.
[VanL87] P.J.M. Van Laarhoven, E.H.L. A arts, “Simulated annealing : theory and appli ca -
tions”, D. Reidel Publishing Company, Dordrecht (The Netherlands), 1987.