[1] |
LECOUTRE C . Constraint Networks:Techniques and Algorithms[M]. London: John Wiley & Sons,Inc 2009
|
[2] |
GOLOMB S W , BAUMERT L D . Backtrack programming[J]. Journal of the ACM, 1965,(12): 51-524.
|
[3] |
DORIGO M . Optimization,Learning and Natural Algorithms[D]. Politecnico di Milano, 1992
|
[4] |
SOLNON C . Ants can solve constraint satisfaction problems[J]. IEEE Transactions on Evolutionary Computation, 2002,6(4): 347-357.
|
[5] |
CORMEN T H , et al. Introduction to Algorithms[M]. Cambridge MIT Press, 2001. 840-890.
|
[6] |
EIBEN A E , MICHALEWICZ Z , SCHOENAUER M , et al. Parameter Control in Evolutionary Algorithms[M]. Springer Berlin Heidelberg, 2007.
|
[7] |
SMITH B , DYER M . Locating the phase transition in binary constraint satisfaction problems[J]. Artificial Intelligence, 1996,81(1): 155-181.
|
[8] |
CHEESEMAN P , KANEFSKY B , TAYLOR . Where the really hard problems are[A]. Proceedings of IJCAI[C]. 1991. 331-337.
|
[9] |
GOMES C , SHMOYS D . Completing quasigroups or latin squares:a structured graph coloring problem[A]. Proceedings of Computational Symposium on Graph Coloring and Generalization[C]. 2002. 22-39.
|
[10] |
CARBON B , et al. Radio link frequency assignment[J]. Constraints, 1999,(4): 79-89.
|
[11] |
SADEH N , FOX M S . Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem[J]. Artificial Intelligence, 1996,86(1): 1-41.
|
[12] |
PARLETT P . The Penguin Book of Patience[M]. Penguin Press, 1996.
|