Dynamic programming method in the generalized courier problem (Q733995): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem. II: Exact methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem. Approximate algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5388611 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The iterations method in generalized courier problem with singularity in the definition of cost functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal bottleneck routing problem with constraints in the form of precedence conditions / rank | |||
Normal rank | |||
Latest revision as of 01:22, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming method in the generalized courier problem |
scientific article |
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
