Störmer, Peter and Jünger, Michael (1995). Solving large-scale traveling salesman problems with parallel Branch-and-Cut. ['eprint_fieldopt_monograph_type_preprint' not defined].

[thumbnail of zpr95-191.pdf]
Preview
 PDF
zpr95-191.pdf
Download (296kB) | Preview

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.

Item Type: Monograph (['eprint_fieldopt_monograph_type_preprint' not defined])
Creators:
Creators
Email
ORCID
ORCID Put Code
Störmer, Peter
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Jünger, Michael
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-546981
Date: 1995
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54698

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item