Go to content
UR Home

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

Schneider, Johannes ; Froschhammer, Christine ; Morgenstern, Ingo ; Husslein, Thomas ; Singer, Johannes Maria
[img]PDF
(1MB) - Repository staff only
Date of publication of this fulltext: 09 Aug 2010 12:12


Abstract

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 ...

plus


Owner only: item control page
  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons