Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones

Changxing Dong, Christian Ernst, Gerold J├Ąger, Dirk Richter, Paul Molitor. Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. In Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti, editors, Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009. pages 3-6, 2009. [doi]

Abstract

Abstract is missing.