A Descent Algorithm for the Multihour Sizing of Traffic Networks

DOI10.1002/J.1538-7305.1977.TB00569.XMaRDI QIDQ4147803zbMATH OpenOpenAlexFDO

Authors Wolfgang B. Elsner

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cited in

(5)

• Equitable transit charges for multi-administration telecommunications networks
• A polynomial-time algorithm for message routing in hierarchical communication networks
• A linear programming model for design of communications networks with time varying probabilistic demands
• Design of private backbone networks. I: Time varying traffic
• Routing and capacity assignment in backbone communication networks under time varying traffic conditions

This page was built for publication: A Descent Algorithm for the Multihour Sizing of Traffic Networks

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