A dynamic programming algorithm for the travelling repairman problem (Q3363089)
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: A dynamic programming algorithm for the travelling repairman problem |
scientific article; zbMATH DE number 4215728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming algorithm for the travelling repairman problem |
scientific article; zbMATH DE number 4215728 |
Statements
1989
0 references
deadlines
0 references
minimizing the maximum lateness
0 references
polynomial algorithms
0 references
0.905802607536316
0 references
0.8448578715324402
0 references
0.8317451477050781
0 references
0.8059406280517578
0 references
0.8053627610206604
0 references
