Local search with constraint propagation and conflict-based heuristics
- 31 July 2002
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 139 (1) , 21-45
- https://doi.org/10.1016/s0004-3702(02)00221-7
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Extending GENET with lazy arc consistencyIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998
- A constraint-based approach for examination timetabling using local repair techniquesPublished by Springer Nature ,1998
- A branch & bound algorithm for the open-shop problemDiscrete Applied Mathematics, 1997
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Constraint propagation with interval labelsArtificial Intelligence, 1987
- Arc and path consistency revisitedArtificial Intelligence, 1986
- Consistency in networks of relationsArtificial Intelligence, 1977
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976