Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes

 Access to full text

 Full (PDF)

1. [1] E. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley and Sons (1997). Zbl0869.00019MR1458630
2. [2] A. Aggoun and N. Beldiceanu, Extending chip in order to solve complex scheduling problems. J. Math. Comput. Modelling 17 (1993) 57–73. 
3. [3] K. Apt, From chaotic iteration to constraint propagation, in 24th International Colloquium on Automata, Languages and Programming (ICALP ’97), Springer. Lect. Notes Comput. Sci. 1256 (1997) 36–55. Invited lecture. 
4. [4] N. Beldiceanu and E. Contejean, Introducing global constraints in chip. J. Math. Comput. Modelling 20 (1994) 97–123. Zbl0816.68048
5. [5] F. Benhamou, Heterogeneous constraint solving, in Proceedings of the Fifth international conference on algebraic and logic programming, ALP’96, Springer. Lect. Notes Comput. Sci 1256 (1996) 62–76. 
6. [6] M. Clergue, J.K. Hao and F. Saubion, A chessboard coloring problem revisited, in Proceedings of the 7th Workshop on Practical Solving of NP-complete Problems (JNPC01), Toulouse (2001). 
7. [7] F. Focacci, F. Laburthe, and A. Lodi, Local search and constraint programming, in Handbook of Metaheuristics, edited by F. Glover and G. Kochenberger, Kluwer (2002). Zbl1137.90729MR1974807
8. [8] I. Gent, T. Walsh and B. Selman, http://www.4c.ucc.ie/~tw/csplib/, funded by the UK Network of Constraints. 
9. [9] F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers (1997). Zbl0930.90083MR1665424
10. [10] P. Van Hentenryck, Constraint Satisfaction in Logic Programming. MIT Press (1989). MR1013366
11. [11] J.H. Holland, Adaptation in Natural and Artificial Systems. U. of Michigan Press (1975). Zbl0317.68006MR441393
12. [12] N. Jussien and O. Lhomme, Local search with constraint propagation and conflict-based heuristics. Artif. Intell. 139 (2002) 21–45. Zbl1015.68056
13. [13] N. Jussien and O. Lhomme, Vers une unification des algorithmes de résolution de csp, in $8^e$ Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC’02) (2002) 155–168. 
14. [14] A. Mackworth, Encyclopedia on Artificial Intelligence, chapter Constraint Satisfaction. John Wiley (1987). 
15. [15] C.T. Maravelias and I.E. Grossmann, Using milp and cp for the scheduling of batch chemical processes. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Spinger. Lect. Notes Comput. Sci. 3011 (2004) 1–20. Zbl1094.90559
16. [16] K. Mariott and P. Stuckey, Programming with Constraints, An introduction. MIT Press (1998). Zbl0935.68098MR1615090
17. [17] R. Mohr and T.C. Henderson, Arc and path consistency revisited. Artif. Intell. 28 (1986) 225–233. 
18. [18] G. Pesant and M. Gendreau, A view of local search in constraint programming, in Proc. of the Second International Conference on Principles and Practice of Constraint Programming, edited by E. Freuder, Springer. Lect. Notes Comput. Sci. 1118 (1996) 353–366. 
19. [19] S. Prestwich, A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences, in Principles and Practice of Constraint Programming - CP 2000 edited by R. Dechter, Springer. Lect. Notes Comput. Sci. 1894 (2000) 337–352. Zbl1044.68789
20. [20] J.C. Régin, A filtering algorithm for constraint of difference in csps, in National Conference of Artificial Intelligence (1994) 362–367. 
21. [21] P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in Principles and Practice of Constraint Programming - CP98, Springer. Lect. Notes Comput. Sci. 1520 (1998) 417–431. 
22. [22] E. Tsang, Foundations of Constraint Satisfaction. Academic Press, London (1993). 
23. [23] M. Vasquez and A. Dupont, Filtrage par arc-consistance et recherche tabou pour l’allocation de fréquence avec polarisation, in Actes des JNPC 2002 (2002).