GA-easy and GA-hard constraint satisfaction problems
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 267-283
- https://doi.org/10.1007/3-540-59479-5_30
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An evolutionary heuristic for the maximum independent set problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Genetic algorithms with multi-parent recombinationPublished by Springer Nature ,1994
- Adaptation in Natural and Artificial SystemsPublished by MIT Press ,1992
- Solving the n-queens problem using genetic algorithmsPublished by Association for Computing Machinery (ACM) ,1992
- Genetic Operators for Sequencing ProblemsPublished by Elsevier ,1991
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- A discrete stochastic neural network algorithm for constraint satisfaction problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980