New modeling approaches for the design of local access transport area networks

European Journal of Operational Research

Volumn 127, Issue 1, 2000, Pages 94-108

  Sherali, Hanif D ^a   Lee, Youngho ^b   Park, Taehyung ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b US West Advanced Technologies   (United States)

Author keywords

Integer Programming; Lagrangian relaxations; Reformulation linearization technique (RLT); Telecommunication networks

Indexed keywords

EID: 0347109592     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00325-2     Document Type: Article

References (26)

1. Aardal, K.Y., 1998. Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming 81, 149-175.
2. Aardal, K., Pochet, Y., Wolsey, L.A., 1995. Capacitated facility location: Valid inequalities and facets. Mathematics of Operations Research 20, 562-582.
3. Balakrishnan, A., Magnanti, T.L., Shulman, A., Wong, R.T., 1993. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research 33, 239-284.
4. Bienstock, D., Günlük, O., 1996. Capacitated network design - Polyhedral structure and computation. INFORMS Journal on Computing 8, 243-259.
5. Cho, G., Shaw, D.X., 1995. Limited column generation for local access telecommunication network design - Formulations, algorithms, and implementation. Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN.
6. Boorstyn, R.R., Frank, H., 1977. Large-scale network topological optimization. IEEE Transactions on Communications 25, 29-47.
7. Chou, W., Ferrante, F., Gerke, L., 1978. An algorithm for optimally locating network access facilities. ICC '78, 24.5.1-24.5.8.
8. Cook, W., 1990. Integer programming solution for capacity expansion of the local access network. Technical Paper TM-ARH-017914, Bell Communications Research, Murray Hill, NJ.
9. Francis, R.L., McGinnis, L.F., White, J.A., 1992. Facility Layout and Location: An Analytical Approach. Prentice-Hall, Englewood Cliffs, NJ.
10. Gerla, M., Kleinlock, L., 1977. On the topological design of distributed computer networks. IEEE Transactions on Communications 25, 48-60.
11. Grötschel, M., Monma, C., 1990. Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM Journal on Discrete Mathematics 3, 502-523.
12. Grötschel, M., Monma, C., Stoer, M., 1991. Polyhedral approaches to network survivability. In: Roberts, F., Hwang, F., Monma, C.L. (Eds.), Reliability of Computer and Communication Networks, vol. 5, Series in Discrete Mathematics and Computer Science, American Mathematical Society, Providence, RI, pp. 121-141.
13. Grötschel, M., Monma, C., Stoer, M., 1992a. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research 40, 309-330.
14. Grötschel, M., Monma, C., Stoer, M., 1992b. Facets for polyhedra arising in the designing of communication networks with low-connectivity constraints. SIAM Journal on Optimization 2, 474-504.
15. Grötschel, M., Monma, C., Stoer, M., 1994. Design of survivable networks. In: Ball, M.O., Magnanti, T.L., Monma, C., Nemhauser, G. (Eds.), Network Models, vol. 6, Handbook of Operations Research and Management Science, North-Holland, Amsterdam.
16. Jacobsen, S.K., 1983. Heuristic for the capacitated plant location model. European Journal of Operational Research 12, 253-261.
17. Leung, J.M.Y., Magnanti, T.L., 1993. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming 44, 271-291.
18. McGregor, P.V., Shen, D., 1977. Network design: An algorithm for the access facility location problem. IEEE Transactions on Communications 25, 61-73.
19. Padberg, M.W., Van Roy, T.J., Wolsey, L.A., 1985. Valid linear inequalities for fixed charge problems. Operations Research 33, 842-861.
20. Shaw, D.X., 1993. Limited column generation technique for several telecommunication network design problems. Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN.
21. Shaw, D.X., 1995. Local access network design and its extensions. Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN.
22. Sherali, H.D., Adams, W.P., 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3, 411-430.
23. Sherali, H.D., Adams, W.P., 1994. A hierarchy of relaxation and convex hull characterizations for mixed integer zero-one programming problems. Discrete Applied Mathematics 52, 83-106.
24. Sherali, H.D., Adams, W.P., Driscoll, P. J., 1998. Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Operations Research 46 (3), 396-405.
25. Sherali, H.D., Choi, G., Tuncbilek, C.H., 2000. A variable target value method for nondifferentiable optimization. Operations Research Letters 26 (1), 1-8.
26. Stoer, M., 1993. Design of Survivable Networks, vol. 1531, Lecture Notes in Mathematics, Springer, Berlin.