Metaheuristics can solve sudoku puzzles
- 1 May 2007
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Heuristics
- Vol. 13 (4), 387-401
- https://doi.org/10.1007/s10732-007-9012-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Graph Coloring with Adaptive Evolutionary AlgorithmsJournal of Heuristics, 1998
- The phase-transition niche for evolutionary algorithms in timetablingLecture Notes in Computer Science, 1996
- Improving evolutionary timetabling with delta evaluation and directed mutationLecture Notes in Computer Science, 1994
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Simulated Annealing: Theory and ApplicationsPublished by Springer Science and Business Media LLC ,1987
- The computational complexity of recognizing critical setsPublished by Springer Science and Business Media LLC ,1984
- Optimization by Simulated AnnealingScience, 1983