Generic hybrid algorithms for solving constraint satisfaction problems
Hervé Deleau; Jin-Kao Hao; Frédéric Saubion
RAIRO - Operations Research (2010)
- Volume: 39, Issue: 2, page 87-103
- ISSN: 0399-0559
Access Full Article
topAbstract
topHow to cite
topReferences
top- E. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley and Sons (1997).
- A. Aggoun and N. Beldiceanu, Extending chip in order to solve complex scheduling problems. J. Math. Comput. Modelling17 (1993) 57–73.
- 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.
- N. Beldiceanu and E. Contejean, Introducing global constraints in chip. J. Math. Comput. Modelling20 (1994) 97–123.
- F. Benhamou, Heterogeneous constraint solving, in Proceedings of the Fifth international conference on algebraic and logic programming, ALP'96, Springer. Lect. Notes Comput. Sci1256 (1996) 62–76.
- 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).
- 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).
- I. Gent, T. Walsh and B. Selman, , funded by the UK Network of Constraints. URIhttp://www.4c.ucc.ie/~tw/csplib/
- F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers (1997).
- P. Van Hentenryck, Constraint Satisfaction in Logic Programming. MIT Press (1989).
- J.H. Holland, Adaptation in Natural and Artificial Systems. U. of Michigan Press (1975).
- N. Jussien and O. Lhomme, Local search with constraint propagation and conflict-based heuristics. Artif. Intell.139 (2002) 21–45.
- N. Jussien and O. Lhomme, Vers une unification des algorithmes de résolution de csp, in 8e Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'02) (2002) 155–168.
- A. Mackworth, Encyclopedia on Artificial Intelligence, chapter Constraint Satisfaction. John Wiley (1987).
- 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.
- K. Mariott and P. Stuckey, Programming with Constraints, An introduction. MIT Press (1998).
- R. Mohr and T.C. Henderson, Arc and path consistency revisited. Artif. Intell.28 (1986) 225–233.
- 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.
- 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.
- J.C. Régin, A filtering algorithm for constraint of difference in csps, in National Conference of Artificial Intelligence (1994) 362–367.
- 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.
- E. Tsang, Foundations of Constraint Satisfaction. Academic Press, London (1993).
- 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).