Author:
Dong Changxing,Jäger Gerold,Richter Dirk,Molitor Paul
Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. A Computational Study. Princeton University Press, Princeton (2006)
2. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J., Espinoza, D., Goycoolea, M., Helsgaun, K.: Certification of an optimal Tour through 85,900 cities. Oper. Res. Lett. 37(1), 11–15 (2009)
3. Cook, W., Seymour, P.: Tour Merging via Branch-Decomposition. INFORMS J. Comput. 15(3), 233–248 (2003)
4. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
5. Ernst, C., Dong, C., Jäger, G., Molitor, P., Richter, D.: Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction (submitted for Publication, 2009)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献