Complexity and approximation for Traveling Salesman Problems with profits

Enrico Angelelli, Cristina Bazgan, M. Grazia Speranza, Z. Tuza

Research output: Article

4 Citations (Scopus)

Abstract

In TSP with profits we have to find an optimal tour and a set of customers satisfying a specific constraint. In this paper we analyze three different variants of TSP with profits that are NP-hard in general. We study their computational complexity on special structures of the underlying graph, both in the case with and without service times to the customers. We present polynomial algorithms for the polynomially solvable cases and fully polynomial time approximation schemes (FPTAS) for some NP-hard cases.

Original languageEnglish
Pages (from-to)54-65
Number of pages12
JournalTheoretical Computer Science
Volume531
DOIs
Publication statusPublished - 2014

Fingerprint

Traveling salesman problem
Travelling salesman problems
Profit
Profitability
Customers
NP-complete problem
Polynomials
Fully Polynomial Time Approximation Scheme
Polynomial Algorithm
Approximation
Computational complexity
Computational Complexity
Graph in graph theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Complexity and approximation for Traveling Salesman Problems with profits. / Angelelli, Enrico; Bazgan, Cristina; Speranza, M. Grazia; Tuza, Z.

In: Theoretical Computer Science, Vol. 531, 2014, p. 54-65.

Research output: Article

Angelelli, Enrico ; Bazgan, Cristina ; Speranza, M. Grazia ; Tuza, Z. / Complexity and approximation for Traveling Salesman Problems with profits. In: Theoretical Computer Science. 2014 ; Vol. 531. pp. 54-65.
@article{b6db92d843b64ec89869295704b035b6,
title = "Complexity and approximation for Traveling Salesman Problems with profits",
abstract = "In TSP with profits we have to find an optimal tour and a set of customers satisfying a specific constraint. In this paper we analyze three different variants of TSP with profits that are NP-hard in general. We study their computational complexity on special structures of the underlying graph, both in the case with and without service times to the customers. We present polynomial algorithms for the polynomially solvable cases and fully polynomial time approximation schemes (FPTAS) for some NP-hard cases.",
keywords = "Approximation algorithm, Computational complexity, Cycle, Path, Routing problem with profit, Tree",
author = "Enrico Angelelli and Cristina Bazgan and Speranza, {M. Grazia} and Z. Tuza",
year = "2014",
doi = "10.1016/j.tcs.2014.02.046",
language = "English",
volume = "531",
pages = "54--65",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Complexity and approximation for Traveling Salesman Problems with profits

AU - Angelelli, Enrico

AU - Bazgan, Cristina

AU - Speranza, M. Grazia

AU - Tuza, Z.

PY - 2014

Y1 - 2014

N2 - In TSP with profits we have to find an optimal tour and a set of customers satisfying a specific constraint. In this paper we analyze three different variants of TSP with profits that are NP-hard in general. We study their computational complexity on special structures of the underlying graph, both in the case with and without service times to the customers. We present polynomial algorithms for the polynomially solvable cases and fully polynomial time approximation schemes (FPTAS) for some NP-hard cases.

AB - In TSP with profits we have to find an optimal tour and a set of customers satisfying a specific constraint. In this paper we analyze three different variants of TSP with profits that are NP-hard in general. We study their computational complexity on special structures of the underlying graph, both in the case with and without service times to the customers. We present polynomial algorithms for the polynomially solvable cases and fully polynomial time approximation schemes (FPTAS) for some NP-hard cases.

KW - Approximation algorithm

KW - Computational complexity

KW - Cycle

KW - Path

KW - Routing problem with profit

KW - Tree

UR - http://www.scopus.com/inward/record.url?scp=84904091568&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904091568&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2014.02.046

DO - 10.1016/j.tcs.2014.02.046

M3 - Article

AN - SCOPUS:84904091568

VL - 531

SP - 54

EP - 65

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -