Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time (Q3652226)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time |
scientific article |
Statements
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time (English)
0 references
17 December 2009
0 references
approximation algorithm
0 references
inapproximability
0 references
min-max vehicle routing
0 references
path covers
0 references
