A Descent Algorithm for the Multihour Sizing of Traffic Networks
From MaRDI portal
Publication:4147803
DOI10.1002/j.1538-7305.1977.tb00569.xzbMath0371.90040OpenAlexW2037714286MaRDI QIDQ4147803
Publication date: 1977
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1977.tb00569.x
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items
Equitable transit charges for multi-administration telecommunications networks, A polynomial-time algorithm for message routing in hierarchical communication networks, Design of private backbone networks. I: Time varying traffic, A linear programming model for design of communications networks with time varying probabilistic demands, Routing and capacity assignment in backbone communication networks under time varying traffic conditions