Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network

Stefan Tschöke, Reinhard Lüling, Burkhard Monien. Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. In Proceedings of IPPS 95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA. pages 182-189, IEEE Computer Society, 1995. [doi]

Abstract

Abstract is missing.