IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v246y2015i2p392-399.html
   My bibliography  Save this article

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem

Author

Listed:
  • da Cunha, Alexandre Salles
  • Simonetti, Luidi
  • Lucena, Abilio

Abstract

Let G = (V, E) be an undirected graph with costs associated with its edges and K pre-specified root vertices. The K−rooted mini-max spanning forest problem asks for a spanning forest of G defined by exactly K mutually disjoint trees. Each tree must contain a different root vertex and the cost of the most expensive tree must be minimum. This paper introduces a Branch-and-cut algorithm for the problem. It involves a multi-start Linear Programming heuristic and the separation of some new optimality cuts. Extensive computational tests indicate that the new algorithm significantly improves on the results available in the literature. Improvements being reflected by lower CPU times, smaller enumeration trees, and optimality certificates for previously unattainable K = 2 instances with as many as 200 vertices. Furthermore, for the first time, instances of the problem with K ∈ {3, 4} are solved to proven optimality.

Suggested Citation

  • da Cunha, Alexandre Salles & Simonetti, Luidi & Lucena, Abilio, 2015. "Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 392-399.
    • Handle: RePEc:eee:ejores:v:246:y:2015:i:2:p:392-399
    DOI: 10.1016/j.ejor.2015.05.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715003719
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.05.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mekking, M. & Volgenant, A., 2010. "Solving the 2-rooted mini-max spanning forest problem by branch-and-bound," European Journal of Operational Research, Elsevier, vol. 203(1), pages 50-58, May.
    2. Yamada, Takeo & Takahashi, Hideo & Kataoka, Seiji, 1996. "A heuristic algorithm for the mini-max spanning forest problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 565-572, June.
    3. Yamada, Takeo & Takahashi, Hideo & Kataoka, Seiji, 1997. "A branch-and-bound algorithm for the mini-max spanning forest problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 93-103, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mekking, M. & Volgenant, A., 2010. "Solving the 2-rooted mini-max spanning forest problem by branch-and-bound," European Journal of Operational Research, Elsevier, vol. 203(1), pages 50-58, May.
    2. Kataoka, Seiji & Araki, Norio & Yamada, Takeo, 2000. "Upper and lower bounding procedures for minimum rooted k-subtree problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 561-569, May.
    3. Fujimoto, Masako & Yamada, Takeo, 2006. "An exact algorithm for the knapsack sharing problem with common items," European Journal of Operational Research, Elsevier, vol. 171(2), pages 693-707, June.
    4. Xiaofei Liu & Yajie Li & Weidong Li & Jinhua Yang, 2023. "Combinatorial approximation algorithms for the maximum bounded connected bipartition problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
    5. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:246:y:2015:i:2:p:392-399. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.