Approximation algorithms for group prize-collecting and location-routing problems
From MaRDI portal
Publication:1003471
DOI10.1016/j.dam.2008.05.013zbMath1155.90416OpenAlexW2011973760MaRDI QIDQ1003471
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.013
Related Items (3)
A survey of recent research on location-routing problems ⋮ A survey of variants and extensions of the location-routing problem ⋮ An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- An application of simultaneous diophantine approximation in combinatorial optimization
- Hamiltonian location problems
- Geometric algorithms and combinatorial optimization
- Transformations of generalized ATSP into ATSP.
- Generalized Steiner problems and other variants
- Generalized network design problems.
- An efficient transformation of the generalized vehicle routing problem
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Approximation algorithm for the group Steiner network problem
- The prize collecting traveling salesman problem
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A General Approximation Technique for Constrained Forest Problems
- On the generalized minimum spanning tree problem
This page was built for publication: Approximation algorithms for group prize-collecting and location-routing problems
