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

DOI10.1109/26.99143zbMath0754.90021OpenAlexW2140853429MaRDI QIDQ3986978

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

sufficient convergence conditionsiterative link-by-link optimizationmulti-destination dynamic routing

Mathematics Subject Classification ID

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

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