The online prize-collecting traveling salesman problem
type: Item
instance of: scholarly article
title: The online prize-collecting traveling salesman problem
zbMATH Open document ID: 1190.90152
author: Giorgio Ausiello
author: Vincenzo Bonifaci
author: Luigi Laura
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
full work available at URL: http://hdl.handle.net/11590/379873
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5694981
zbMATH Keywords: on-line algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
OpenAlex ID: W2151159917
cites work: Q2728857
cites work: Q4503935
cites work: Algorithms for the on-line travelling salesman
cites work: Algorithms for the on-line quota traveling salesman problem
cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
cites work: The prize collecting traveling salesman problem
cites work: Q4228499
cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
cites work: Saving an epsilon
cites work: A General Approximation Technique for Constrained Forest Problems
DOI: 10.1016/J.IPL.2008.03.002
Recommended article: The prize collecting traveling salesman problem
Recommended article: A note on the prize collecting traveling salesman problem
Recommended article: The online prize-collecting facility location problem
Recommended article: The prize collecting traveling salesman problem: II. Polyhedral results
Recommended article: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
Recommended article: The on-line asymmetric traveling salesman problem
Recommended article: Algorithms and Data Structures
Recommended article: Online travelling salesman problem on a circle
Recommended article: Competitive algorithms for the on-line traveling salesman
Recommended article: Online traveling salesman problems with rejection options
description: scientific article; zbMATH DE number 5694981