Branch & sample: A simple strategy for constraint satisfaction
Author:
- 1 September 1989
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 29 (3) , 395-408
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Ultrametricity for physicistsReviews of Modern Physics, 1986
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- General Branch and Bound, and its relation to A∗ and AO∗Artificial Intelligence, 1984
- Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristicsArtificial Intelligence, 1983
- Combinatorially implosive algorithmsCommunications of the ACM, 1982
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Computerized facility layout with graph theoryComputers & Industrial Engineering, 1981
- Backtracking with multi-level dynamic search rearrangementActa Informatica, 1981
- Consistency in networks of relationsArtificial Intelligence, 1977
- Backtrack programming techniquesCommunications of the ACM, 1975