Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
A Hybrid Immunological Search for the Weighted Feedback Vertex Set Problem Read chapter Read first chapter

2020 | OriginalPaper | Chapter

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs

Authors : Edward Kh. Gimadi, Oxana Tsidulko

Published in: Learning and Intelligent Optimization

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The Prize-Collecting Traveling Salesman Problem is a class of generalizations of the classic Traveling Salesman Problem (TSP) where it is not necessary to visit all the vertices. Given the edge costs and a certain profit associated with each vertex, the goal is to find a route which satisfies maximum collected profit and minimum traveling costs constraints. We show polynomial-time approximation algorithms for two variants of the problem and establish conditions under which the presented algorithms are asymptotically optimal on random inputs.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems
next chapter An Artificial Bee Colony Algorithm for the Multiobjective Energy Reduction Multi-Depot Vehicle Routing Problem
Literature
1.
Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28(1), 254–262 (1999)MathSciNetCrossRef
2.
Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413–420 (1993)MathSciNetCrossRef
3.
Climer, S., Zhang, W.: Rearrangement clustering: pitfalls, remedies, and applications. JMLR 7, 919–943 (2006)MathSciNetMATH
4.
Dell’Amico, M., Maffioli, F., Sciomachen, A.: A Lagrangian heuristic for the Prize-Collecting Travelling Salesman Problem. Ann. Oper. Res. 81, 289–305 (1998)MathSciNetCrossRef
5.
Fischetti, M., Toth, P.: An additive approach for the optimal solution of the Prize-Collecting Travelling Salesman Problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 319–343 (1988)
6.
7.
Gimadi, E.K., Le Gallou, A., Shakhshneyder, A.V.: Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded above instances. J. Appl. Ind. Math. 3(2), 207–221 (2009)MathSciNetCrossRef
8.
Gimadi, E.K., Khachay, M.Y.: Extremal Problems on the Set of Permutations. Ural Federal University, Ekaterinburg (2016). (in Russian)
9.
10.
Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 760–769. Society for Industrial and Applied Mathematics (2000)
11.
Paul, A., Freund D., Ferber A., Shmoys D.B., Williamson D.P.: Prize-collecting TSP with a budget constraint. In: 25th Annual European Symposium on Algorithms (ESA 2017), Leibniz International Proceedings in Informatics (LIPIcs), pp 62:1–62:14 (2017)
12.
Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Gene ordering in partitive clustering using microarray expressions. J. Biosci. 32(5), 1019–1025 (2007)CrossRef
Metadata
Title
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs
Authors
Edward Kh. Gimadi
Oxana Tsidulko
Copyright Year
2020
Book
Learning and Intelligent Optimization

Print ISBN: 978-3-030-38628-3

Electronic ISBN: 978-3-030-38629-0

Copyright Year: 2020

DOI
https://doi.org/10.1007/978-3-030-38629-0_16

Premium Partner

    Image Credits