Skip to main content
Log in

Design of capacitated networks with tree configurations

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper considers the problem of designing a capacitated network with a tree configuration (CTP). For a given set of nodes with their capacities,k types of link facilities with various characteristics, and installation cost for connecting each pair of nodes using each type of link facility, the problem is to find a tree network which satisfies the given traffic requirements between all pairs of nodes and minimizes total installation cost. We formulate (CTP) as an integer programming problem using path variables. To solve the linear programming relaxation which has exponentially many variables, we develop a polynomial-time column generation procedure. Moreover, to tighten the formulation, an efficient preprocessing procedure is devised and some classes of valid inequalities are found. Using the results, we develop a branch- and-cut algorithm with column generation where an efficient branching rule is adopted. Computational results show that the algorithm can solve practically-sized problems to optimality within a reasonable time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Adolphson and T.C. Hu, Optimal linear ordering, SAIM J. Appl. Math. 25(1973)403–423.

    Article  Google Scholar 

  2. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch- and-price: Column generation for solving huge integer programs,Mathematical Programming: State of the Art, eds. J.R. Birge and K.G. Murty (1994) pp. 186–207.

  3. K.M. Chandy and T. Lo, The capacitated minimum spanning tree, Networks 3(1973)173–182.

    Google Scholar 

  4. B. Gavish, Topological design of centralized computer networks — formulation and algorithms, Networks 12(1982)355–377.

    Google Scholar 

  5. B. Gavish, Topological design of computer communication networks — the overall design problem, Eur. J. Oper. Res. 58(1992)149–172.

    Article  Google Scholar 

  6. B. Gavish, Augmented Lagrangian based algorithm for centralized network design, IEEE Trans. Commun. COM-33(1985)1247–1257.

    Google Scholar 

  7. P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting-stock problem, Oper. Res. 9(1961)849–859.

    Google Scholar 

  8. R.E. Gomory and T.C. Hu, Multi-terminal network flows, J. SIAM (1964)551–570.

  9. D. Gusfield, Very simple method for all pairs network flow analysis, SIAM J. Comput. 19(1990)143–155.

    Article  Google Scholar 

  10. T.C. Hu, Optimum communication spanning tree, SIAM J. Comput. 3(1974)188–195.

    Article  Google Scholar 

  11. K.L. Jones, I.J. Lustig, J.M. Farvolden and W.B. Powell, Multicommodity network flowsd: The impact of formulation on decomposition, Math. Progr. 62(1993)95–117.

    Article  Google Scholar 

  12. F. Kaefer and J.S. Park, A method for interconnecting LANs with survivability considerations,Proc. 3rd Int. Conf. on Telecommunication Systems, Nashville, TN (1995) pp. 244–254.

  13. A. Kershenbaum and R.R. Boorstyn, Centralized teleprocessing network design, Networks 13(1983)279–293.

    Google Scholar 

  14. A. Kersenbaum, P. Kermini and G. Grover, MENTOR: An algorithm for mesh network topological optimization and routing, IEEE Trans. Commun. COM-39(1991)503–513.

    Article  Google Scholar 

  15. E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, NY, 1976).

    Google Scholar 

  16. L. LeBlanc, J.S. Park, V. Sridhar and J. Kalvenes, Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach, Telecom. Syst., this issue.

  17. T.L. Magnanti and P. Mirchandani, Shortest paths, single origin—destination network design, and associated polyhedra, Networks 23(1993)103–121.

    Google Scholar 

  18. T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two-facility capacitied network loading problem, to appear in Oper. Res.

  19. G.L. Nemhauser, The age of optimization: Solving large-scale real-world problems, Oper. Res. 42(1994)5–13.

    Google Scholar 

  20. G.L. Nemhauser and S. Park, A polyhedral approach to edge coloring, Oper. Res. Lett. 10(1991) 315–322.

    Article  Google Scholar 

  21. G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).

    Google Scholar 

  22. M. Padborg and G. Rinaldi, A branch- and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev. 33(1991)60–100.

    Article  Google Scholar 

  23. C.H. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217–230.

    Google Scholar 

  24. K. Park, S. Kang and S. Park, An integer programming approach to the bandwidth packing problem, to appear in Manag. Sci.

  25. M. Parker and J. Ryan, A column generation algorithm for bandwidth packing, Telecom. Syst. 2(1994)185–195.

    Article  Google Scholar 

  26. J.F. Shoch and J.A. Hupp, Measured performance of an ethernet local network, Commun. ACM 23(1980)711–721.

    Article  Google Scholar 

  27. V. Sridhar, J.S. Park and B. Gavish, Optimal interconnection of token ring networks using source routing bridges, Working Paper, Department of Management Sciences, University of Iowa, Iowa City, IA (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, K., Park, K. & Park, S. Design of capacitated networks with tree configurations. Telecommunication Systems 6, 1–19 (1996). https://doi.org/10.1007/BF02114283

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02114283

Keywords

Navigation