Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP)

Manuel I. Capel Tuñón, Mario Rossainz López. Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP). In 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005 - 2 March 2005, Puebla, Mexico. pages 262-267, IEEE Computer Society, 2005. [doi]

Abstract

Abstract is missing.