A computationally efficient iterative solution of the multidestination optimal dynamic routing problem (Q3986978)
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 30691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computationally efficient iterative solution of the multidestination optimal dynamic routing problem |
scientific article; zbMATH DE number 30691 |
Statements
A computationally efficient iterative solution of the multidestination optimal dynamic routing problem (English)
0 references
28 June 1992
0 references
sufficient convergence conditions
0 references
multi-destination dynamic routing
0 references
iterative link-by-link optimization
0 references
0.8663355112075806
0 references
0.7848316431045532
0 references
0.7784101366996765
0 references
0.7764122486114502
0 references
0.7743638753890991
0 references
