Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

The Maximum Scatter TSP on a Regular Grid

URN to cite this document: urn:nbn:de:bvb:703-epub-2524-2

Title data

Hoffmann, Isabella ; Kurz, Sascha ; Rambau, Jörg:
The Maximum Scatter TSP on a Regular Grid.
Bayreuth , 2015 . - 6 S.

[img] PDF
Hoffmann+Kurz+Rambau_preprint_The_Maximum_Scatter TSP_on_a_Regular_Grid.pdf - Published Version
Available under License Creative Commons BY 3.0: Attribution .

Download (333kB)

Abstract

In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting processes. We extend an algorithm by Arkin et al. that yields optimal solutions for nodes on a line to a regular (m x n)-grid. The new algorithm WEAVE(m,n) takes linear time to compute an optimal tour in some cases and is asymptotically optimal.

Further data

Item Type: Preprint, postprint
Keywords: TSP; Maximum Scatter TSP; linear-time algorithm
DDC Subjects: 500 Science > 510 Mathematics
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy > Chair Mathematics in Economy - Univ.-Prof. Dr. Jörg Rambau
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-epub-2524-2
Date Deposited: 25 Nov 2015 09:40
Last Modified: 21 Mar 2019 08:19
URI: https://epub.uni-bayreuth.de/id/eprint/2524

Downloads

Downloads per month over past year