Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction

Christian Ernst, Changxing Dong, Gerold J├Ąger, Dirk Richter, Paul Molitor. Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. In Bo Chen, editor, Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings. Volume 6124 of Lecture Notes in Computer Science, pages 119-130, Springer, 2010. [doi]

Abstract

Abstract is missing.