Abstract
We present a heuristic for multiplexer location problems in local access networks. The effectiveness of the heuristic is demonstrated on several “real-life” problem instances.
Similar content being viewed by others
References
D. Bienstock, A lot-sizing problem on trees, related to network design, Math. Oper. Res. (1991), to appear.
I. Bárány, J. Edmonds and L.A. Wolsey, Packing and covering a tree by subtrees, Combinatorica 6(1986)221–233.
A. Balakrishnan, T.L. Magnanti, A. Shulman and R.T. Wong, Models for planning capacity expansion in local access telecommunication networks, Working Paper No. 3048-89-Ms, MIT Sloan School (1989).
A. Balakrishnan, T.L. Magnanti and R.T. Wong, A decomposition approach for expanding local access telecommunication networks, Working Paper OR C(1,0)4-91, MIT (1991).
I. Bárány, T. Van Roy and L.A. Wolsey, Uncapacitated lot-sizing: the convex hull of solutions, Math. Progr. Study 22(1984)32–43.
S. Chang and B. Gavish, Telecommunications network topological design and capacity expansion: formulations and algorithms, Telecomm. Syst. 1(1993)99–131.
W.J. Cook, Integer programming solutions for capacity expansion of the local access network, Bellcore Technical Memorandum TSV-018565 (1991).
W.J. Cook, T. Rutherford, H.E. Scarf and D. Shallcross, An implementation of the generalized basis reduction algorithm for integer programming, Math. Progr. (1991), to appear.
M. Florian, J.K. Lenstra and A.H.G. Rinnooy Kan, Deterministic production planning: algorithms and complexity, Manag. Sci. 26(1980)669–679.
B. Gavish, M. Helme and K. Sheng-Roan, Single period exhaust-relief model with distance constraints, Technical Report TN 88-413.2, GTE Laboratories (1988).
B. Gavish and A. Shulman, Efficient algorithm for outside plant design problem, Technical Report, GTE Laboratories (1987).
B. Gailly and L.A. Wolsey, Capacity expansion of the local access network, manuscript (1991).
T.L. Magnanti and P. Mirchandani, Shortest paths, network design and associated polyhedra, manuscript (1990).
Y. Pochet and L.A. Wolsey, manuscript (1991).
I. Saniee, Economic capacity expansion of the local area network, Bellcore Technical Memorandum TSV-018565 (1991).
L.A. Wolsey, Facets for a linear inequality in 0–1 variables, Math. Progr. 8(1975)165–178.
L.A. Wolsey, Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints, Discr. Appl. Math. 29(1990)251–261.
Author information
Authors and Affiliations
Additional information
Partially funded by an NSF PYI award, a consulting agreement with Bellcore, and an equipment grant from IBM.
Rights and permissions
About this article
Cite this article
Bienstock, D. Computational experience with an effective heuristic for some capacity expansion problems in local access networks. Telecommunication Systems 1, 379–400 (1993). https://doi.org/10.1007/BF02136170
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02136170