Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

The multi-stripe travelling salesman problem

Tools
- Tools
+ Tools

Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2017) The multi-stripe travelling salesman problem. Annals of Operations Research , 259 (1-2). pp. 21-34. doi:10.1007/s10479-017-2513-4 ISSN 0254-5330.

[img]
Preview
PDF
WRAP-multi-stripe-travelling-problem-Deineko-2017.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution 4.0.

Download (881Kb) | Preview
[img] PDF
WRAP_DeinekoAnnals_of_OR.pdf - Accepted Version
Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer.

Download (181Kb)
Official URL: http://doi.org/10.1007/s10479-017-2513-4

Request Changes to record.

Abstract

In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with q ≥ 1, the objective function sums the costs for travelling from one city to each of the next q cities along the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic assignment problem. We analyze the computational complexity of the q-stripe TSP for various classes of specially structured distance matrices. We derive NP-hardness results as well as polyomially solvable cases. One of our main results generalizes a well-known theorem of Kalmanson from the classical TSP to the q-stripe TSP.

Item Type: Journal Article
Divisions: Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences
Faculty of Social Sciences > Warwick Business School
Journal or Publication Title: Annals of Operations Research
Publisher: Springer New York LLC
ISSN: 0254-5330
Official Date: December 2017
Dates:
DateEvent
December 2017Published
18 May 2017Available
13 September 2016Accepted
Volume: 259
Number: 1-2
Page Range: pp. 21-34
DOI: 10.1007/s10479-017-2513-4
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access (Creative Commons)
Date of first compliant deposit: 27 September 2016
Date of first compliant Open Access: 11 October 2018

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us