Tabu search for maximal constraint satisfaction problems
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 196-208
- https://doi.org/10.1007/bfb0017440
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Analysis of heuristic methods for partial constraint satisfaction problemsPublished by Springer Nature ,1996
- Empirical studies of heuristic local search for constraint solvingPublished by Springer Nature ,1996
- Local search and the number of solutionsPublished by Springer Nature ,1996
- Optimization-based heuristics for maximal constraint satisfactionPublished by Springer Nature ,1995
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Partial constraint satisfactionArtificial Intelligence, 1992
- Algorithms for the maximum satisfiability problemComputing, 1990
- How easy is local search?Journal of Computer and System Sciences, 1988
- Using tabu search techniques for graph coloringComputing, 1987
- Optimization by Simulated AnnealingScience, 1983