Solving constraint satisfaction problems using genetic algorithms
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 542-547
- https://doi.org/10.1109/icec.1994.350002
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- LibGAPublished by Association for Computing Machinery (ACM) ,1993
- Genetic Algorithms Are NOT Function OptimizersPublished by Elsevier ,1993
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Solving the n-queens problem using genetic algorithmsPublished by Association for Computing Machinery (ACM) ,1992
- Genetic Algorithms + Data Structures = Evolution ProgramsPublished by Springer Nature ,1992
- The N-queens problem and genetic algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Genetic Operators for Sequencing ProblemsPublished by Elsevier ,1991
- Epistasis Variance: A Viewpoint on GA-HardnessPublished by Elsevier ,1991
- Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristicsArtificial Intelligence, 1983
- Consistency in networks of relationsArtificial Intelligence, 1977