Empirical studies of heuristic local search for constraint solving
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 194-208
- https://doi.org/10.1007/3-540-61551-2_75
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiabilityPublished by American Mathematical Society (AMS) ,1996
- Constraint handling in evolutionary search: A case study of the frequency assignmentPublished by Springer Nature ,1996
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Partial constraint satisfactionArtificial Intelligence, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Algorithms for the maximum satisfiability problemComputing, 1990
- Using tabu search techniques for graph coloringComputing, 1987
- A Connectionist Machine for Genetic HillclimbingPublished by Springer Nature ,1987
- Optimization by Simulated AnnealingScience, 1983
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973