Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683)
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 6028438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the traveling repairman and speeding deliveryman problems |
scientific article; zbMATH DE number 6028438 |
Statements
Approximation algorithms for the traveling repairman and speeding deliveryman problems (English)
0 references
26 April 2012
0 references
approximation algorithms
0 references
graph algorithms
0 references
time windows
0 references
repairman problem
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
0 references
0.978611707687378
0 references
0.8302645087242126
0 references
0.805655837059021
0 references
0.8053957223892212
0 references
0.7977575063705444
0 references
