Enforcing arc consistency on global constraints by solving subproblems on the fly

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

Volumn 1713, Issue , 1999, Pages 103-117

  Bessière, Christian ^a   Règin, Jean Charles ^b  

^a LIRMM   (France)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ARC-CONSISTENCY ALGORITHMS; COMBINATORIAL PROBLEM; CONSTRAINT NETWORKS; GLOBAL CONSTRAINTS; NON-BINARY CONSTRAINTS; PROBLEM MODELLING; REAL WORLD CONSTRAINTS; REAL-LIFE APPLICATIONS;

PROBLEM SOLVING;

EID: 35048823850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_8     Document Type: Conference Paper

References (5)

1. C. Bessière and J-C. Règin. Arc consistency for general constraint networks: pre- liminary results. In Proceedings of IJCAI'97, pages 398-404, Nagoya, 1997.
2. P. Van Hentenryck. Incremental constraint satisfaction in logic programming. In proceedings ICLP'90, pages 189-202, Jerusalem, Israel, 1990.
3. ILOG. ILOG Solver 4.4 User's manual. ILOG S.A., 1999.
4. J-C. Règin. Minimization of the number of breaks in sports scheduling problems using constraint programming. In proceedings DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, pages P7:1-23, 1998.
5. B.M. Smith. Succeed-first or fail-first: A case study in variable and value ordering. In proceedings ILOG Solver and ILOG Scheduler Second International Users' Conference, Paris, France, 1996.