On hybridization of local search and constraint propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3132, Issue , 2004, Pages 299-313

  Monfroy, Eric ^a   Saubion, Frédéric ^b   Lambert, Tony ^a,b  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LOCAL SEARCH (OPTIMIZATION); LOGIC PROGRAMMING; TABU SEARCH;

BOUND CONSISTENCY; CHAOTIC ITERATION; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; HYBRID RESOLUTIONS; REDUCTION FUNCTION; SPECIFIC CLASS; THEORETICAL MODELING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048842225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_21     Document Type: Article

References (15)

1. E. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley and Sons, 1997.
2. K. Apt. From chaotic iteration to constraint propagation. In 24th International Colloquium on Automata, Languages and Programming (ICALP '97, number 1256 in LNCS, pages 36-55. Springer, 1997. invited lecture.
3. K. Apt. The rough guide to constraint propagation. In Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP'99), volume 1713 of LNCS, pages 1-23, Springer, 1999. (Invited lecture).
4. K. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
5. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In Handbook of Metaheuristics. Kluwer, 2002.
6. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
7. L. Granvilliers and E. Monfroy. Implementing Constraint Propagation by Composition of Reductions. In C. Palamidessi, editor, Proceedings of International Conference on Logic Programming, LNCS 2916, pages 300-314. Springer, 2003.
8. N. Jussien and O. Lhomme. Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence, 139(1):21-45, 2002.
9. A. Mackworth. Encyclopedia on Artificial Intelligence, chapter Constraint Satisfaction. John Wiley, 1987.
10. K. Mariott and P. Stuckey. Programming with Constraints, An introduction. MIT Press, 1998.
11. R. Mohr and T.C. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225-233, 1986.
12. 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, number 1118 in LNCS, pages 353-366. Springer, 1996.
13. S. Prestwich. A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences. In Principle and Practice of Constraint Programming - CP 2000, number 1894 in LNCS, pages 337-352. Springer, 2000.
14. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Principles and Practice of Constraint Programming - CP98, number 1520 in LNCS, pages 417-431. Springer, 1998.
15. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London, 1993.