On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

  • Luis Gouveia
  • Markus Leitner
  • Ivana Ljubić
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)

Abstract

We consider a new network design problem that generalizes the Hop and Diameter Constrained Minimum Spanning and Steiner Tree Problem as follows: given an edge-weighted undirected graph whose nodes are partitioned into a set of root nodes, a set of terminals and a set of potential Steiner nodes, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops between each relevant node and an arbitrary root does not exceed a given hop limit H. The set of relevant nodes may be equal to the set of terminals, or to the union of terminals and root nodes. This paper presents theoretical and computational comparisons of flow-based vs. path-based mixed integer programming models for this problem. Disaggregation by roots is used to improve the quality of lower bounds of both models. To solve the problem to optimality, we implement branch-and-price algorithms for all proposed formulations. Our computational results show that the branch-and-price approaches based on path formulations outperform the flow formulations if the hop limit is not too loose.

Keywords

Mixed Integer Programming Column Generation Network Design Problem Steiner Tree Problem Bender Decomposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Achterberg, T.: SCIP: Solving constraint integer programs. Mathematical Programming Computation 1(1), 1–41 (2009)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Balakrishnan, A., Altinkemer, K.: Using a hop-constrained model to generate alternative communication network design. INFORMS Journal on Computing 4(2), 192–205 (1992)MATHCrossRefGoogle Scholar
  3. 3.
    Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science 40(7), 846–867 (1994)MATHCrossRefGoogle Scholar
  4. 4.
    Beasley, J.E.: Collection of test data sets for a variety of operations research (OR) problems (1990), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
  5. 5.
    Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS Journal on Computing (2011) (to appear)Google Scholar
  6. 6.
    Dahl, G., Gouveia, L., Requejo, C.: 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, pp. 493–515. Springer (2006)Google Scholar
  7. 7.
    Frangioni, A., Gendron, B.: A stabilized structured Dantzig-Wolfe decomposition method. Mathematical Programming (to appear, 2012)Google Scholar
  8. 8.
    Gouveia, L.: Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research 95(1), 178–190 (1996)MATHCrossRefGoogle Scholar
  9. 9.
    Gouveia, L., Paias, A., Sharma, D.: Modeling and solving the rooted distance-constrained minimum spanning tree problem. Computers & Operations Research 35(2), 600–613 (2008)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Mathematical Programming 128, 123–148 (2011)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Gouveia, L., Telhada, J.: The multi-weighted Steiner tree problem: A reformulation by intersection. Computers & Operations Research 35, 3599–3611 (2008)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Ljubić, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Vienna University of Technology (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Luis Gouveia
    • 1
  • Markus Leitner
    • 2
  • Ivana Ljubić
    • 3
  1. 1.Departamento de Estatística e Investigação Operacional - Centro de Investigação Operacional, Faculdade de CiênçiasUniversidade de LisboaPortugal
  2. 2.Institute of Computer Graphics and AlgorithmsVienna University of TechnologyAustria
  3. 3.Department of Statistics and Operations ResearchUniversity of ViennaAustria

Personalised recommendations