5Kennedy J.and Eberhart R.C.,Particle swarm optimization.Proceedings of the IEEE International Conference on Neural Networks (Perth).IEEE Service Center,Piscataway,NJ,IV.1995,1942 ～1948.
6Eberhart R.C.and Kennedy J.,A new optimizer using particle swarm theory.The 6th Int'1 Symposium on Micro Machine and Human Science,Nagoya,Japan,1995.
7徐宗本.计算智能-模拟进化计算,北京:高等教育出版社,2005.
8Kennedy J.and Eberhart R.C.,A discrete binary particle swarm optimization.Procceedings of 1997 Conference on System,Man,and Cybern-etices.Piscataway,NJ,IEEEService Center,1997,4104～4109.
9Clerc M.,Discrete particle swarm optimization illustrated by the Traveling Salesman Problem.http:// www.mauriceclerc.net,2000-2-29.
10Frans Van den Bergh.An analysis of particle swarm optimizers[PhD dissertation].Pretoria:University of Pretoria,2001.
2Jiang Xin-wen, Peng Li-hong, Wang Qi. MSP Problem: Its NP- Completeness and Its Algorithm [C] // The 5th International Conference on Ubiquitous Information Technologies and Appli- cations. 2010:101-105.
3Cook S. The Complexity of Theory-proving Procedures [C] // Proceedings of 3rd Ann ACM Syrup on Theory of Computing. 1971:151-158.
4Johnson D. The NP-completeness Column: An Ongoing Guide [J]. Journal of Algorithms, 1987,7:285-300.
5Johnson D. The NP-completeness Column: An Ongoing Guide [J]. Journal of Algorithms, 1987,8 : 438-448.
6Johnson D. The NP-completeness Column [J]. ACM transac- tions on Algorithms,2005: 160-176.
7Agrawal M,Kayal N,Saxena N. PRIMES is in P [J]. Annals of Mathematics, 2004,2 781-793.
8Deolalikar V. Vinay Deolalikar explains the proof that P=/=NP [EB/OL]. http://www, allvoices, com/contributed-news/647- 640t-vinay-deolalikar-explains-the-proof-that-p-np, 2010-08 06/ 2010-09-01.
9Vardi M Y. On P, NP, and Computational Complexity [J]. Com- munications of the ACM,2010,53(ll):5.
10Horbach A, Bartsch T, Briskom D. Using a SAT-solver to schedule sports leagues [J]. Journal of Scheduling,2012,1 117- 125.
