Approximation results for min-max path cover problems in vehicle routing (Q3065634)
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 results for min-max path cover problems in vehicle routing |
scientific article; zbMATH DE number 5833123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation results for min-max path cover problems in vehicle routing |
scientific article; zbMATH DE number 5833123 |
Statements
Approximation results for min-max path cover problems in vehicle routing (English)
0 references
6 January 2011
0 references
approximation algorithms
0 references
approximation hardness
0 references
min-max path cover
0 references
vehicle routing
0 references
0 references
0 references
0 references
0.8698266744613647
0 references
0.8592477440834045
0 references
0.8263376355171204
0 references
0.8169867396354675
0 references
0.8114200234413147
0 references
