Dynamic programming in the routing problem with constraints and costs depending on a list of tasks (Q403862)
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 6336223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming in the routing problem with constraints and costs depending on a list of tasks |
scientific article; zbMATH DE number 6336223 |
Statements
Dynamic programming in the routing problem with constraints and costs depending on a list of tasks (English)
0 references
29 August 2014
0 references
traveling salesman problem
0 references
arrival and departure points
0 references
0.8616827130317688
0 references
0.8369561433792114
0 references
0.8258640170097351
0 references
0.8023457527160645
0 references
0.7972445487976074
0 references
