Designing reliable tree networks with two cable technologies

European Journal of Operational Research

Volumn 105, Issue 3, 1998, Pages 552-568

  Gouveia, Luis ^a   Janssen, Eric ^b,c  

^a UNIVERSITY OF LISBON   (Portugal)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c Exact Software   (Netherlands)

Author keywords

Hop constraints; Multicommodity flows; Reliability; Trees

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; RELIABILITY; TELECOMMUNICATION CABLES; TREES (MATHEMATICS);

HOP CONSTRAINTS; LAGRANGEAN HEURISTICS; MULTICOMMODITY FLOWS; TERMINAL LAYOUT PROBLEM (TLP);

ELECTRIC NETWORK TOPOLOGY;

EID: 0032028626     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00067-2     Document Type: Article

References (16)

1. Balakrishnan, A., Altinkemer, K., 1992. Using a hop-constrained model to generate alternative communication network designs. ORSA Journal on Computing 4 (2), 192-205.
2. Balakrishnan, A., Magnanti, T., Mirchandani, P., 1994. Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science 40, 846-867.
3. Beasley, J.E., 1993. Lagrangean relaxation. In: Reeves, C. (Ed.), Modern Heuristic Techniques for Combinatorial Problems. Blackwel Scientific Publications, Ch. 6.
4. Geoffrion, A.M., 1974. Lagrangean relaxation for integer programming. Mathematical Programming Study 2, 82-114.
5. Goemans, M., 1994. Arborescence polytopes for series-parallel graphs. Discrete Applied Mathematics 51, 277-289.
6. Goemans, M., Myung, Y., 1993. A catalog of Steiner tree formulations. Networks 23, 19-28.
7. Gouveia, L., 1995. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Computers and Operations Research 22 (9), 959-970.
8. Gouveia, L., 1996. Multicommodity flow formulations and minimal spanning trees with hop constraints. European Journal of Operational Research 95, 178-190.
9. Held, M.H., Wolfe, P., Crowder, H.D., 1974. Validation of subgradient optimization. Mathematical Programming 6, 62-88.
10. Janssen, E.A.W., 1995. Two level minimal spanning trees with hop constraints and primary connectivity constraints. Master's Thesis, MABES, Erasmus University Rotterdam.
11. De Jongh, A., Gendreau, M., Labbé, M., 1995. Finding disjoint routes in telecommunications networks with two technologies. IS-MG Discussion Paper 95/08.
12. Khoury, B.N., Pardalos, P.M., Du, D-Z., 1993. A test problem generator for the Steiner problem in graphs. ACM Transactions on Mathematical Software 19 (4), 509-522.
13. LeBlanc, L.J., Reddoch, R., 1990. Reliable link topology/capacity and routing in backbone telecommunication networks. Working Paper 90-08, Owen Graduate School of Management, Vanderbilt University.
14. LeBlanc, L.J., Reddoch, R., Chifflet, J., Mahey, P., 1995. Routing in telecommunications with flow restrictions. Working Paper 95-07, Owen Graduate School of Management, Vanderbilt University.
15. Magnanti, T.L., Wolsey, L.A., 1995. Optimal trees. Handbooks in Operations Research and Management Science series, vol. 7, Networks, pp. 503-615.
16. Prim, R., 1957. Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389-1401.