Two-stage dynamic programming in the routing problem with decomposition (Q6078066)
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 7742611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-stage dynamic programming in the routing problem with decomposition |
scientific article; zbMATH DE number 7742611 |
Statements
Two-stage dynamic programming in the routing problem with decomposition (English)
0 references
27 September 2023
0 references
dynamic programming
0 references
route
0 references
megalopolis
0 references
precedence conditions
0 references
0.8210824728012085
0 references
0.81148761510849
0 references
0.7890642881393433
0 references
0.7815586924552917
0 references
0.7744831442832947
0 references
