M. Dorigo and T. Stützle, Ant Colony Optimization, 2004.

F. Glover and M. Laguna, Tabu Search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

P. Van, H. , and L. Michel, Constraint-Based Local Search, 2005.

M. Khichane, P. Albert, and C. Solnon, Integration of ACO in a Constraint Programming Language, 6th International Conference on Ant Colony Optimization and Swarm Intelligence (A ANTS2008), pp.84-95, 2008.
DOI : 10.1007/978-3-540-87527-7_8

S. Kirkpatrick, C. Gellat, and M. Vecchi, Optimization by simulated annealing. science, pp.671-680, 1983.

A. H. Land and A. G. Doig, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol.28, issue.3, pp.497-520, 1960.
DOI : 10.2307/1910129

A. K. Mackworth and E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems[ac1-3], Artificial Intelligence, issue.25, pp.65-74, 1985.

B. Meyer, Hybrids of constructive meta-heuristics and constraint programming : A case study with ACO Hybrid Metaheuristics-An emergent approach for optimization, 2008.

G. Nemhauser and A. Wolsey, Integer and combinatorial optimization, 1988.
DOI : 10.1002/9781118627372

URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

C. Papadimitriou and K. Steiglitz, Combinatorial optimization?Algorithms and complexity, 1982.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, CP04, 10th International Conference on Principales and Practice of Constraint Programming, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41

C. Solnon, Ants can solve constraint satisfaction problems, IEEE Transactions on Evolutionary Computation, vol.6, issue.4, pp.347-357, 2002.
DOI : 10.1109/TEVC.2002.802449

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

T. Stützle, H. H. Hoos, . Max, . Min-ant, and . System, ??? Ant System, Future Generation Computer Systems, vol.16, issue.8, pp.889-914, 2000.
DOI : 10.1016/S0167-739X(00)00043-1