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

DOI10.1109/26.99143MaRDI QIDQ3986978zbMATH OpenOpenAlexFDO

Authors G. I. Stassinopoulos, M. G. Kazantzakis

Publication date 28 June 1992

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.99143

zbMATH Keywords

iterative link-by-link optimizationmulti-destination dynamic routingsufficient convergence conditions

Mathematics Subject Classification ID

Graph theory (05C99) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Optimal Dynamic Routing in Multidestination Networks
• A combinatorial user optimal dynamic traffic assignment algorithm
• A parallel optimal routing algorithm
• Optimal dynamic routing in communication networks with continuous traffic
• An optimal distributed routing algorithm

Cited in

(6)

• Optimal Dynamic Routing in Multidestination Networks
• scientific article; zbMATH DE number 4049386 (Why is no real title available?)
• scientific article; zbMATH DE number 4059093 (Why is no real title available?)
• Time complexity of a path formulated optimal routing algorithm
• On an iterative procedure for solving a routing problem with constraints
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints

This page was built for publication: A computationally efficient iterative solution of the multidestination optimal dynamic routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986978)