Network Synthesis and Dynamic Network Optimization

Publisher Summary Determining a minimum cost network designed in such a way as to meet a given set of specifications is a fundamental class of problems that arise in a wide variety of contexts of applications, such as transportation science, telecommunication network engineering, distribution systems, energy networks, and water distribution networks. The chapter discusses two important problems arising in the area of distributed telecommunication networks: (1) network synthesis under non-simultaneous single- commodity or multi-commodity flow requirements and (2) determining an optimal investment policy for meeting increasing multi-commodity flow requirements over a given time period. The importance of the latter problem stems from the fact that most optimum network design problems are essentially dynamic in nature in the sense that the time factor should be explicitly taken into account. The chapter discusses how the most practically applicable solution methods are related to the work on static models.

[1]  K. Mani Chandy,et al.  The Design or Multipoint Linkages in a Teleprocessing Tree Network , 1972, IEEE Transactions on Computers.

[2]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

[3]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[4]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem , 1971 .

[5]  Norman Zadeh,et al.  On building minimum cost communication networks , 1973, Networks.

[6]  Hoang Hai Hoc.  A Computational Approach to the Selection of an Optimal Network , 1973 .

[7]  Lalit R. Bahl,et al.  Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals , 1978, IEEE Transactions on Computers.

[8]  Giorgio Gallo,et al.  Concave cost minimization on networks , 1979 .

[9]  Paul Gray,et al.  Technical Note - Exact Solution of the Fixed-Charge Transportation Problem , 1971, Oper. Res..

[10]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[11]  Michel Minoux.  Planification a court et a moyen terme d’un réseau de télécommunications , 1974 .

[12]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .

[13]  D. I. Steinberg,et al.  The fixed charge problem , 1970 .

[14]  M. Minoux,et al.  Multiflots de coût minimal avec fonctions de coût concaves , 1976 .

[15]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[16]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[17]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[18]  M. Minoux,et al.  Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints , 1981 .

[19]  M. R. Rao,et al.  Optimal Network Capacity Planning: A Shortest-Path Scheme , 1975, Oper. Res..

[20]  I. T. Frisch,et al.  The design of large-scale networks , 1972 .

[21]  Hoang Hai Hoc,et al.  Topological optimization of networks: A nonlinear mixed integer model employing generalized benders , 1980 .

[22]  R. Weischedel,et al.  Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .

[23]  Arthur D. Hall.  An Overview of Economies of Scale in Existing Communications Systems , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[26]  K. Mani Chandy,et al.  The Capacitated Minimum Spanning Tree , 1973, Networks.

[27]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[28]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[29]  T. B. Boffey,et al.  Solving the optimal network problem , 1979 .

[30]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[31]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[32]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[33]  M. Minoux,et al.  Synthèse optimale d’un réseau de télécommunication avec contraintes de sécurité , 1981 .

[34]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[35]  P. Brooker,et al.  Optimal expansion of an existing network , 1974, Math. Program..

[36]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[37]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[38]  Michael Florian,et al.  Exact and approximate algorithms for optimal network design , 1979, Networks.

[39]  M. Ferguson,et al.  Topological Design of Multipoint Teleprocessing Networks , 1974, IEEE Trans. Commun..

[40]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[41]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[42]  Michel Minoux.  Optimisation et Planification de Réseaux de Télécommunications , 1975, Optimization Techniques.

[43]  Aaron Kershenbaum,et al.  Computing capacitated minimal spanning trees efficiently , 1974, Networks.

[44]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[45]  M. Malek-Zavarei,et al.  On the fixed cost flow problem , 1972 .

[46]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[47]  Norman Zadeh,et al.  On building minimum cost communication networks over time , 1974, Networks.

[48]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[49]  Lynn W. Ellis,et al.  Scale Economy Coefficients for Telecommunications , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[50]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[51]  J. Billheimer,et al.  Network Design with Fixed and Variable Cost Elements , 1973 .

[52]  A. Scott.  The optimal network problem: Some computational procedures , 1969 .

[53]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[54]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.