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 this page instead for the normal view: Dynamic programming in the routing problem with constraints and costs depending on a list of tasks |
scientific article; zbMATH DE number 6336223
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
