Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Mathematical Programming

Volumn 128, Issue 1-2, 2011, Pages 123-148

  Gouveia, Luis ^a   Simonetti, Luidi ^b   Uchoa, Eduardo ^c  

^a UNIVERSITY OF LISBON   (Portugal)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Cutting planes; Integer programming: formulations; Networks graphs: tree algorithms

Indexed keywords

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; CUTTING PLANES; LAYERED GRAPHS; MINIMUM SPANNING TREE PROBLEM; NETWORKS/GRAPHS; NP-HARD PROBLEM; ORIGINAL DESIGN; QUALITY OF SERVICE CONSTRAINTS; STEINER TREE PROBLEM;

COMPUTATIONAL COMPLEXITY; DESIGN; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PARALLEL ARCHITECTURES; PLANT EXTRACTS; QUALITY OF SERVICE; TELECOMMUNICATION NETWORKS;

TREES (MATHEMATICS);

EID: 79957934437     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-009-0297-2     Document Type: Article

References (33)

1. N.R. Achuthan L. Caccetta P.A. Caccetta J.F. Geelen 1994 Computational methods for the diameter restricted minimum weight spanning tree problem Australas. J. Comb. 10 51 71 1296940 0819.90114
2. S. Chopra M.R. Rao 1994 The Steiner tree problem I: formulations, compositions and extension of facets Math. Program. 64 2 209 229 1285323 0821.90124 10.1007/BF01582573
3. G. Dahl 1998 The 2-hop spanning tree problem Oper. Res. Lett. 23 21 26 1664213 0957.90093 10.1016/S0167-6377(98)00029-7 (Pubitemid 128458151)
4. G. Dahl 1999 Notes on polyhedra associated with hop-constrained paths Oper. Res. Lett. 25 97 100 1709999 0973.90065 10.1016/S0167-6377(99)00025-5
5. Dahl, G.; Flatberg, T.; Foldnes, N.; Gouveia, L.: The jump formulation for the hop-constrained minimum spanning tree problem. Tech. Rep. CIO 5, University of Lisbon (2004)
6. Dahl G.; Gouveia L.; Requejo C.: On formulations and methods for the hop-constrained minimum spanning tree problem. In: Pardalos, P.; Resende, M. (eds) Handbook of Optimization in Telecommunications.; pp. 493-515. Springer, Berlin (2006)
7. Garey M.R.; Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
8. L. Gouveia 1995 Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints Comput. Oper. Res. 22 9 959 970 0854.90139 10.1016/0305-0548(94)00074-I
9. L. Gouveia 1996 Multicommodity flow models for spanning trees with hop constraints Eur. J. Oper. Res. 95 1 178 190 0947.90513 10.1016/0377-2217(95) 00090-9 (Pubitemid 126391980)
10. L. Gouveia 1998 Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints INFORMS J. Comput. 10 2 180 188 1637563 1054.90622 10.1287/ijoc.10.2.180 (Pubitemid 128669126)
11. L. Gouveia T.L. Magnanti 2003 Network flow models for designing diameter-constrained minimum- spanning and Steiner trees Networks 41 3 159 173 1970121 1106.90014 10.1002/net.10069
12. L. Gouveia T.L. Magnanti C. Requejo 2004 A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees Networks 44 4 254 265 2098388 1058.90069 10.1002/net.20034
13. L. Gouveia T.L. Magnanti C. Requejo 2006 An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees Ann. Oper. Res. 146 19 39 2260544 1107.90007 10.1007/s10479-006-0049-0 (Pubitemid 44290701)
14. L. Gouveia C. Requejo 2001 A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem Eur. J. Oper. Res. 132 3 539 552 1832514 1055.90084 10.1016/S0377-2217(00)00143-0 (Pubitemid 32487096)
15. Gouveia, L.; Simonetti, L.; Uchoa, E.: Modelling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Tech. Rep. RPEP, vol. 8, no.7, Universidade Federal Fluminense, Engenharia de Produção, Niterói, Brazil (2008)
16. Gruber, M.; Raidl, G.R.: A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. In: Proceedings of the 2nd International Network Optimization Conference, Lisbon, pp. 178-185 (2005)
17. Hwang F.; Richards D.; Winter P.: The Steiner Tree Problems. Annals of Discrete Mathematics. North-Holland, Amsterdam (1992)
18. H. Kerivin A.R. Mahjoub 2005 Design of survivable networks: a survey Networks 46 1 1 21 2151240 1072.90003 10.1002/net.20072 (Pubitemid 41092973)
19. T. Koch A. Martin 1998 Solving Steiner tree problems in graphs to optimality Networks 33 207 232 1645419 10.1002/(SICI)1097-0037(199810)32: 3<207::AID-NET5>3.0.CO;2-O (Pubitemid 128134280)
20. N. Maculan 1987 The Steiner problem in graphs Ann. Discret. Math. 31 185 212 878779
21. Magnanti T.L.; Wolsey L.A.: Optimal trees. In: ~Ball, M.; Magnanti, T.L.; Monma, C.; Nemhauser, G. (eds) Network Models, Handbook in Operations Research and Management Science, vol. 7, pp. 503-615. Elsevier, Amsterdam (1995)
22. Manyem, P.; Stallmann, M.F.M.: Some approximation results in multicasting. Tech. Rep. TR-96-03, North Carolina State University (1996)
23. Noronha, T.F.; Santos, A.C.; Ribeiro, C.C.: Constraint programming for the diameter constrained minimum spanning tree problem. In: Proceedings of IV Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics, vol. 30, pp. 93-98. Puerto Varas, Chile (2008)
24. Oliveira, C.; Pardalos, P.; Resende, M.: Optimization problems in multicast tree construction. In: Handbook of Optimization in Telecommunications, pp. 701-731. Springer, Berlin (2006)
25. M. Poggide Aragão E. Uchoa R. Werneck 2001 Dual heuristics on the exact solution of large Steiner problems Electron. Notes Discret. Math. 7 150 153 10.1016/S1571-0653(04)00247-1
26. C. Ribeiro E. Uchoa R. Werneck 2002 A hybrid GRASP with perturbations for the Steiner problem in graphs INFORMS J. Comput. 14 228 246 1918924 10.1287/ijoc.14.3.228.116
27. Santos, A.C.; Lucena, A.; Ribeiro, C.C.: Solving diameter constrained minimum spanning tree problems in dense graphs. In: Experimental and Efficient Algorithms, Lecture Notes in Computer Science, vol. 3059/2004, pp. 458-467. Springer, Berlin (2004)
28. H. Takahashi A. Matsuyama 1980 An approximate solution for the Steiner problem in graphs Mathematica Japonica 24 573 577 565542 0435.05036
29. Uchoa, E.: Algoritmos para problemas de Steiner com aplicaçõ es em projeto de circuitos VLSI. Ph.D. thesis, Pontifícia Universidade Católica do Rio de Janeiro (2001)
30. E. Uchoa R. Fukasawa J. Lysgaard A. Pessoa M. Poggide Aragão D. Andrade 2008 Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation Math. Program. 112 2 443 472 2361932 1146.90059 10.1007/s10107-006-0043-y (Pubitemid 350202448)
31. Werneck, R.: Problema de Steiner em grafos: algoritmos primais, duais e exatos. Master's thesis, Pontifícia Universidade Católica do Rio de Janeiro (2001)
32. R. Wong 1984 A dual ascent approach for Steiner tree problems on a directed graph Math. Program. 28 3 271 287 0532.90092 10.1007/BF02612335 (Pubitemid 14581666)
33. K.A. Woolston S.L. Albin 1988 The design of centralized networks with reliability and availability constraints Comput. Oper. Res. 15 3 207 217 10.1016/0305-0548(88)90033-0 (Pubitemid 18616914)