Title of article :
Approximation algorithms for group prize-collecting and location-routing problems Original Research Article
Author/Authors :
Hagai Glicksman، نويسنده , , Michal Penn، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
In this paper we develop approximation algorithms for generalizations of the following three known combinatorial optimization problems, the Prize-Collecting Steiner Tree problem, the Prize-Collecting Travelling Salesman Problem and a Location-Routing problem.
Keywords :
Group , Prize-collecting , Location , approximation , Travelling salesman , Algorithm
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
