๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A computationally efficient iterative solution of the multidestination optimal dynamic routing problem

โœ Scribed by Stassinopoulos, G.I.; Kazantzakis, M.G.

Book ID
117861942
Publisher
IEEE
Year
1991
Tongue
English
Weight
837 KB
Volume
39
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On design of a survivable network archit
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
โœ Iradj Ouveysi; Andrew Wirth ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 262 KB

We investigate network planning and design under volatile conditions of link failures and trac overload. Our model is a non-simultaneous multi-commodity problem, with any particular two link failure being considered as one scenario. We show that the optimal solution model is not practically solvable