IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v30y2018i2p402-420.html
   My bibliography  Save this article

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Author

Listed:
  • Markus Leitner

    (University of Vienna, Department of Statistics and Operations Research, 1090 Vienna, Austria)

  • Ivana Ljubić

    (ESSEC Business School, 95021 Cergy-Pontoise Cedex, France)

  • Martin Luipersbeck

    (University of Vienna, Department of Statistics and Operations Research, 1090 Vienna, Austria)

  • Markus Sinnl

    (University of Vienna, Department of Statistics and Operations Research, 1090 Vienna, Austria)

Abstract

We present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS), and node-weighted Steiner tree problem (NWSTP). The main component of our framework is a new dual ascent algorithm for the rooted APCSTP, which generalizes Wong’s dual ascent algorithm for the Steiner arborescence problem. The lower bounds and dual information obtained from the algorithm are exploited within powerful bound-based reduction tests and for guiding primal heuristics. The framework is complemented by additional alternative-based reduction tests. Extensive computational results on benchmark instances for the PCSTP, MWCS, and NWSTP indicate the framework’s effectiveness, as most instances from literature are solved to optimality within seconds, including most of the (previously unsolved) largest instances from the recent DIMACS Challenge on Steiner trees. Moreover, results on new asymmetric instances for the APCSTP are reported. Since the addressed network design problems are frequently used for modeling various real-world applications (e.g., in bioinformatics), the implementation of the presented B&B framework has been made publicly available.

Suggested Citation

  • Markus Leitner & Ivana Ljubić & Martin Luipersbeck & Markus Sinnl, 2018. "A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 402-420, May.
  • Handle: RePEc:inm:orijoc:v:30:y:2018:i:2:p:402-420
    DOI: 10.1287/ijoc.2017.0788
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2017.0788
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2017.0788?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
    ---><---

    References listed on IDEAS

    as
    1. A. Balakrishnan & T. L. Magnanti & R. T. Wong, 1989. "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research, INFORMS, vol. 37(5), pages 716-740, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Daniel Rehfeldt & Thorsten Koch, 2022. "On the Exact Solution of Prize-Collecting Steiner Tree Problems," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 872-889, March.
    2. Ziye Tang & Yang Jiao & R. Ravi, 2022. "Combinatorial Heuristics for Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 370-384, January.
    3. Pedersen, Jaap & Weinand, Jann Michael & Syranidou, Chloi & Rehfeldt, Daniel, 2024. "An efficient solver for large-scale onshore wind farm siting including cable routing," European Journal of Operational Research, Elsevier, vol. 317(2), pages 616-630.
    4. Kuzbakov, Yerlan & Ljubić, Ivana, 2024. "New formulations for two location problems with interconnected facilities," European Journal of Operational Research, Elsevier, vol. 314(1), pages 51-65.
    5. Ritt, Marcus & Pereira, Jordi, 2020. "Heuristic and exact algorithms for minimum-weight non-spanning arborescences," European Journal of Operational Research, Elsevier, vol. 287(1), pages 61-75.

    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. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    2. Rafael Epstein & Andrés Weintraub & Pedro Sapunar & Enrique Nieto & Julian B. Sessions & John Sessions & Fernando Bustamante & Hugo Musante, 2006. "A Combinatorial Heuristic Approach for Solving Real-Size Machinery Location and Road Design Problems in Forestry Planning," Operations Research, INFORMS, vol. 54(6), pages 1017-1027, December.
    3. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    4. Abdolsalam Ghaderi, 2015. "Heuristic Algorithms for Solving an Integrated Dynamic Center Facility Location - Network Design Model," Networks and Spatial Economics, Springer, vol. 15(1), pages 43-69, March.
    5. Contreras, Ivan & Fernández, Elena & Reinelt, Gerhard, 2012. "Minimizing the maximum travel time in a combined model of facility location and network design," Omega, Elsevier, vol. 40(6), pages 847-860.
    6. M. Gisela Bardossy & S. Raghavan, 2010. "Dual-Based Local Search for the Connected Facility Location and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 584-602, November.
    7. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    8. Herrmann, J. W. & Ioannou, G. & Minis, I. & Proth, J. M., 1996. "A dual ascent approach to the fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 95(3), pages 476-490, December.
    9. Sabyasachi Mitra & Ishwar Murthy, 1998. "A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 40-55, February.
    10. Gouveia, Luis, 1996. "Multicommodity flow models for spanning trees with hop constraints," European Journal of Operational Research, Elsevier, vol. 95(1), pages 178-190, November.
    11. Gendron, Bernard, 2002. "A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"," European Journal of Operational Research, Elsevier, vol. 138(3), pages 671-675, May.
    12. Kaj Holmberg & Di Yuan, 2000. "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem," Operations Research, INFORMS, vol. 48(3), pages 461-481, June.
    13. Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.
    14. Anantaram Balakrishnan & Prakash Mirchandani & Harihara Prasad Natarajan, 2009. "Connectivity Upgrade Models for Survivable Network Design," Operations Research, INFORMS, vol. 57(1), pages 170-186, February.
    15. Agarwal, Y.K. & Aneja, Y.P., 2017. "Fixed charge multicommodity network design using p-partition facets," European Journal of Operational Research, Elsevier, vol. 258(1), pages 124-135.
    16. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    17. Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, August.
    18. H Gunnarsson & M Rönnqvist & D Carlsson, 2006. "A combined terminal location and ship routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 928-938, August.
    19. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    20. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.

    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:inm:orijoc:v:30:y:2018:i:2:p:402-420. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.