Minimax routing problem with a system of priority tasks (Q6119971)
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 7807096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax routing problem with a system of priority tasks |
scientific article; zbMATH DE number 7807096 |
Statements
Minimax routing problem with a system of priority tasks (English)
0 references
20 February 2024
0 references
dynamic programming
0 references
decomposition
0 references
route
0 references
0 references
0 references
0.910161554813385
0 references
0.839831531047821
0 references
0.7902928590774536
0 references
0.7833942770957947
0 references
0.7289530038833618
0 references
