A linear programming model for design of communications networks with time varying probabilistic demands
- 1 March 1981
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 28 (1) , 1-32
- https://doi.org/10.1002/nav.3800280102
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Analytic Approximation of Blocking Probabilities in Circuit Switched Communication NetworksIEEE Transactions on Communications, 1979
- A Class of Nonlinear Integer Programs Solvable by a Single Linear ProgramSIAM Journal on Control and Optimization, 1977
- A Descent Algorithm for the Multihour Sizing of Traffic NetworksBell System Technical Journal, 1977
- Engineering Traffic Networks for More Than One Busy HourBell System Technical Journal, 1977
- Proof of a Convexity Property of the Erlang B FormulaBell System Technical Journal, 1972
- Synthesis of a Communication NetworkJournal of the Society for Industrial and Applied Mathematics, 1964
- An Application of Generalized Linear Programming to Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1962
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Theories for Toll Traffic Engineering in the U. S. A.*Bell System Technical Journal, 1956
- Traffic Engineering Techniques for Determining Trunk Requirements in Alternate Routing Trunk NetworksBell System Technical Journal, 1954