Evolutionary search guided by the constraint network to solve CSP
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 337-342
- https://doi.org/10.1109/icec.1997.592332
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Solving Part-Type Selection and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing AlgorithmIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2006
- Self-adaptivity for constraint satisfaction: learning penalty functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Solving constraint satisfaction problems using genetic algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Genetic Algorithms + Data Structures = Evolution ProgramsPublished by Springer Nature ,1994
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980