HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
- 1 August 1993
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 9 (3) , 268-299
- https://doi.org/10.1111/j.1467-8640.1993.tb00310.x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A distributed asynchronous system for predictive and reactive schedulingArtificial Intelligence in Engineering, 1991
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Constraint satisfaction algorithms1Computational Intelligence, 1989
- Constraint Satisfaction Problems: An OverviewAI Communications, 1989
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Consistency in networks of relationsArtificial Intelligence, 1977
- Backtrack programming techniquesCommunications of the ACM, 1975
- Backtrack ProgrammingJournal of the ACM, 1965