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 (327kB) | Preview
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Paper (Technical Report)
Citations: [error in script] 7 (Google Scholar) | [error in script]
Uncontrolled Keywords: [error in script]
Subjects:
  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

  • Uncontrolled Keywords: branch-and-cut, parallel algorithms, symmetric traveling salesman problem, traveling salesman problem
    Subjects: 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Depositing User: Prof. Dr. Michael Jünger
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 19 Jan 2012 11:02
    Deposit Information:
    ZAIK Number: [error in script]
    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