The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks

DOI10.1109/TCOM.1976.1093310zbMath0348.90062OpenAlexW2158052609MaRDI QIDQ4118948

Mischa Schwartz, Casteret K. Cheung

Publication date: 1976

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (1)

An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints

This page was built for publication: The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks