Approximation algorithms for group prize-collecting and location-routing problems (Q1003471)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for group prize-collecting and location-routing problems |
scientific article; zbMATH DE number 5522965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for group prize-collecting and location-routing problems |
scientific article; zbMATH DE number 5522965 |
Statements
Approximation algorithms for group prize-collecting and location-routing problems (English)
0 references
4 March 2009
0 references
algorithm
0 references
approximation
0 references
prize-collecting
0 references
travelling salesman
0 references
location
0 references
group
0 references
0 references
0.839438796043396
0 references
0.8246361017227173
0 references
0.8235248327255249
0 references
