Go to content
UR Home

Searching for backbones — an efficient parallel algorithm for the traveling salesman problem

Schneider, Johannes and Froschhammer, Christine and Morgenstern, Ingo and Husslein, Thomas and Singer, Johannes Maria (1996) Searching for backbones — an efficient parallel algorithm for the traveling salesman problem. Computer physics communications: an international journal devoted to computational physics and computer programs in physics 96 (2-3), pp. 173-188.

Download (1MB) - Repository staff only

at publisher (via DOI)


The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good solutions for this problem. In this paper we discuss an efficient parallel method to reduce the TSP ...


Export bibliographical data

Item type:Article
Date:1 August 1996
Institutions:Physics > Institute of Theroretical Physics > Professor Morgenstern
Identification Number:
02.50.-r; 02.50.Ga; 02.70.Lq; 89.20.+a; 89.80.+h; 89.90.+nPACS
Keywords:Optimization; Parallel; Monte Carlo; Threshold accepting; TSP; Backbone; Degeneracy
Dewey Decimal Classification:500 Science > 530 Physics
Created at the University of Regensburg:Unknown
Deposited on:09 Aug 2010 12:12
Last modified:13 Mar 2014 13:57
Item ID:16102
Owner only: item control page


Downloads per month over past year

  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons