Author:
Wang Yuping,Han Lixia,Li Yinghua,Zhao Shuguang
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference12 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M. and Szegdy. Proof verification and intractability of approximation problems. Proceedings of 33th IEEE Symposium Foundations of Computer Scienc. Pittsburgh, Pennsylvania, USA. pp.3–22. IEEE Press.
2. Bäck, T. 1996.Evolutionary Algorithms in Theory and Practice, 129New York: Oxford University Press.
3. A hybrid heuristic for the traveling salesman problem
4. Freisleben, B. and Merz, P. New genetic local search operators for the traveling salesman problem. Proceedings of 4th Conference on Parallel Problem Solving from Nature. 1996, Berlin, Germany. pp.616–621. Springer-Verlag.
5. Garey, M. R., Graham, R. L. and Johnson, D. S. Some NP-complete geometric problems. Proceedings of 8th Annual ACM Symposium on Theory of Computing. USA. NY. pp.10–22. ACM Press.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献