Improved approximation algorithms for min-max and minimum vehicle routing problems (Q3196380)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6501913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for min-max and minimum vehicle routing problems |
scientific article; zbMATH DE number 6501913 |
Statements
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (English)
0 references
29 October 2015
0 references
vehicle routing
0 references
cycle cover
0 references
traveling salesman problem
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.9614595174789428
0 references
0.8478559255599976
0 references
0.8408045172691345
0 references
0.8342033624649048
0 references
0.8338109850883484
0 references
