Skip to main content
SpringerLink
Log in

Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem

  • Conference paper
Network Optimization (INOC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6701))

Included in the following conference series:

Abstract

In this paper, we discuss two Integer Programming Formulations for the K-rooted Mini-max Spanning Forest Problem. In the first, connectivity is reinforced through Generalized Subtour Breaking inequalities while the second uses Directed cutset constraints. We implement a Branch-and-cut method based on the first formulation that also computes combinatorial lower bounds from the literature and implements a Linear Programming based multi-start heuristic. Our computational results suggest that the Linear Programming lower bounds compare favorably to combinatorial lower bounds. Instances generated as suggested in the literature were solved easily by the algorithms proposed in this study.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goemans, M.X.: The Steiner Polytope and Related Polyhedra. Mathematical Programming 63, 157–182 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Huang, B., Liu, N.: Bi-level Programming Approach to Optimizing a Logistic Distribution Network with Balancing Requirements. Transportation Research Record (1894), 188–197 (2004)

    Google Scholar 

  3. Kruskal, J.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 7, 48–50 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  4. Magnanti, T.L., Wolsey, L.: Optimal Trees. In: Ball, O., et al. (eds.) Handbooks in OR and MS, vol. 7, pp. 503–615. North-Holland, Amsterdam (1995)

    Google Scholar 

  5. Mekking, M., Volgenant, A.: Solving the 2-rooted mini-max spanning forest problem by branch-and-bound. European Journal of Operational Research 203(1), 50–58 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Padberg, M.W., Rinaldi, G.: A Branch-and-Cut algorithm for resolution of large scale of Symmetric Traveling Salesman Problem. SIAM Review 33, 60–100 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Padberg, M.W., Wolsey, L.: Trees and cuts. Annals of Discrete Mathematics 17, 511–517 (1983)

    MathSciNet  MATH  Google Scholar 

  8. Yamada, T., Takahashi, H., Kataoka, S.: A heuristic algorithm for the mini-max spanning forest problem. European Journal of Operational Research 91(3), 565–572 (1996)

    Article  MATH  Google Scholar 

  9. Yamada, T., Takahashi, H., Kataoka, S.: A branch-and-bound algorithm for the mini-max spanning forest problem. European Journal of Operational Research 101(1), 93–103 (1997)

    Article  MATH  Google Scholar 

  10. Zhou, G., Min, H., Gen, M.: The balanced allocation of customers to multiple distribution centers in the supply chain network: A genetic algorithm approach. Computers and Industrial Engineering (43), 251–261 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Brazil

    Alexandre Salles da Cunha

  2. Instituto de Computação, Universidade Federal Fluminense, Brazil

    Luidi Simonetti

  3. Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Brazil

    Abilio Lucena

Authors
  1. Alexandre Salles da Cunha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luidi Simonetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abilio Lucena
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Julia Pahl  & Stefan Voß  & 

  2. School of Information Systems, Curtin University, 6845, Perth, WA, Australia

    Torsten Reiners

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salles da Cunha, A., Simonetti, L., Lucena, A. (2011). Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21527-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21526-1

  • Online ISBN: 978-3-642-21527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation