Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
- 31 December 1992
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 58 (1-3), 161-205
- https://doi.org/10.1016/0004-3702(92)90007-k
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Partial constraint satisfactionArtificial Intelligence, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- An almost perfect heuristic for the N nonattacking queens problemInformation Processing Letters, 1990
- Divide and conquer under global constraints: A solution to the N-queens problemJournal of Parallel and Distributed Computing, 1989
- How easy is local search?Journal of Computer and System Sciences, 1988
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Using tabu search techniques for graph coloringComputing, 1987
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Backtrack programming techniquesCommunications of the ACM, 1975