Dynamic programming method in the generalized courier problem (Q733995)
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 5617903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming method in the generalized courier problem |
scientific article; zbMATH DE number 5617903 |
Statements
Dynamic programming method in the generalized courier problem (English)
0 references
19 October 2009
0 references
The authors develop a complete mathematical formulation for the Generalized Courier Problem. A number of theorems, propositions and lemmas are developed and convergence estimated are proved. Some examples are illustrated. It require few more numerical experiments.
0 references
dynamic programming
0 references
courier problem
0 references
PC memory
0 references
Bellman function
0 references
travel costs
0 references
optimal solution
0 references
0 references
0.784886360168457
0 references
0.7846205830574036
0 references
0.7795612812042236
0 references
0.7604107856750488
0 references
0.7521959543228149
0 references
