Solving large-scale traveling salesman problems with parallel Branch-and-Cut

Jünger, Michael and Störmer, Peter (1995) Solving large-scale traveling salesman problems with parallel Branch-and-Cut.
Technical Report , 35 p.

Abstract

We introduce the implementation of a parallel Branch-and-Cut algorithm to solve large-scale traveling salesman problems. Rather than using the well-known models of homogeneous distribution and simple Master/Slave communication, we present a more sophisticated distribution that takes the advantage of several independent features of a Branch-and-Cut code. Computational results are reported for several instances of the TSPLIB.


Actions:
Download: [img] Postscript
Download (320Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr95-191
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 02 Apr 2001 00:00
Last Modified: 19 Jan 2012 11:02
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/191