Abstract
In this chapter we present a general framework for modeling the hopconstrained minimum spanning tree problem (HMST) which includes formulations already presented in the literature. We present and survey different ways of computing a lower bound on the optimal value. These include, Lagrangian relaxation, column generation and model reformulation. We also give computational results involving instances with 40 and 80 nodes in order to compare some of the ideas discussed in the chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
N. R. Achuthan, L. Caccetta, P. Caccetta, and J. F. Geelen. Algorithms for the minimum weight spanning tree with bounded diameter problem. In et al. P. H. Phua, editor, Optimization Techniques and Applications, volume 1, pages 297–304. World Scientific, 1992.
R. Ahuja, T. Magnanti, and J. Orlin. Network flows: Theory, algorithms and applications. Prentice Hall, 1993.
D. Alevras, M. Grötschel, and R. Wessaly. A network dimensioning tool. Technical Report SC 96-49, Konrad-Zuse-Zentrum für Informationstechnik, 1996.
A. Balakrishnan and K. Altinkemer. Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing, 4:192–205, 1992.
J. Beasley. An algorithm for the Steiner problem in graphs. Networks, 14:147–159, 1984.
T. Crainic, A. Frangioni, and B. Gendron. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Applied Mathematics, 112:73–99, 2001.
G. Dahl. “The 2-hop spanning tree problem. Operations Research Letters, 23:21–26, 1998.
G. Dahl. Notes on polyhedra associated with hop-constrained paths. Operations Research Letters, 25:97–100, 1999.
Dahl G., N. Foldnes, and L. Gouveia. A note on hop-constrained walk polytopes. Technical Report 1/2003, Centro de Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 2003.
Dahl G. and L. Gouveia. On the directed hop-constrained shortest path problem. Operations Research Letters, 2003. To appear.
B. Gavish. Augmented Lagrangean based algorithms for centralized network design. IEEE Transactions on Communications, COM-33:1247–1257, 1985.
B. Gendron, T. Crainic, and A. Frangioni. Multicommodity capacitated network design. In B Sansò and P. Soriano, editors, Telecommunications network planning. Kluwer Academic Publishers, 1999.
A. Geoffrion. Lagrangian relaxation for integer programming. Mathematical Programming Study, 2:82–114, 1974.
M. Goemans. The Steiner polytope and related polyhedra. Mathematical Programming, 63:157–182, 1994.
L. Gouveia. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Computers and Operations Research, 22: 959–970, 1995.
L. Gouveia. Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research, 95:178–190, 1996.
L. Gouveia. Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS Journal on Computing, 10:180–188, 1998.
L Gouveia and T. Magnanti. Network flow models for designing diameter constrained spanning and Steiner trees. Networks, 41:159–173, 2003.
L. Gouveia, P. Patrício, A. e Sousa, and Valadas R. MPLS over WDM network design with packet level QoS constraints based on ILP models. In Proceedings of IEEE INFOCOM 2003, April 2003.
L. Gouveia and C. Requejo. A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem. European Journal of Operational Research, 132:539–552, 2001.
M. Held, P. Wolfe, and H. Crowder. Validation of subgradient optimization. Mathematical Programming, 6:62–88, 1974.
K. Holmberg and D. Yuan. A Lagrangean heuristic Based branch-and-Bound approach for the capacitated network design problem. Technical Report LiTH-MAT-R-1996-23, Department of Mathematics, Linköping Institute of Technology, 1996.
L. LeBlanc, J. Chifflet, and P. Mahey. Packet routing in telecommunication networks with path and flow restrictions. INFORMS Journal on Computing, 11:188–197, 1999.
T. Magnanti and L. Wolsey. Optimal trees. In Network models, volume 7 of Handbooks in Operations Research and Management Science, pages 503–615. Elsevier, 1996.
P. Manyem and M. Stallmann. Some approximation results in multicasting. Technical report, North Carolina State University, 1996.
R. K. Martin. Generating alternative mixed-integer programming models using variable redefinition. Operations Research, 35:820–831, 1987.
R. K. Martin. Large scale linear and integer optimization: A unified approach. Kluwer Academic Publishers, 1999.
G. L. Nemhauser and L.A. Wolsey. Integer and combinatorial optimization. John Wiley & Sons, 1988.
H. Pirkul and S. Soni. New formulations and solution procedures for the hop constrained network design problem. European Journal of Operational Research, 148: 126–140, 2003.
S. Voss. The Steiner tree problem with hop constraints. Annals of Operations Research, 86:271–294, 1999.
K. Woolston and S. Albin. The design of centralized networks with reliability and availability constraints. Computers and Operations Research, 15:207–217, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Dahl, G., Gouveia, L., Requejo, C. (2006). On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_19
Download citation
DOI: https://doi.org/10.1007/978-0-387-30165-5_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30662-9
Online ISBN: 978-0-387-30165-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)