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

Exact approaches for solving robust prize-collecting Steiner tree problems

Author

Listed:
  • Álvarez-Miranda, Eduardo
  • Ljubić, Ivana
  • Toth, Paolo

Abstract

In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link costs plus the revenues of the customers that are left out is minimized. The problem, as well as some of its variants, is used to model a wide range of applications in telecommunications, gas distribution networks, protein–protein interaction networks, or image segmentation.

Suggested Citation

  • Álvarez-Miranda, Eduardo & Ljubić, Ivana & Toth, Paolo, 2013. "Exact approaches for solving robust prize-collecting Steiner tree problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 599-612.
    • Handle: RePEc:eee:ejores:v:229:y:2013:i:3:p:599-612
    DOI: 10.1016/j.ejor.2013.03.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713002701
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.03.037?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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    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. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2016. "Hub network design problems with profits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 40-59.
    2. Markus Leitner & Ivana Ljubić & Markus Sinnl, 2015. "A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 118-134, February.
    3. Roman E. Shangin & Panos Pardalos, 2016. "Heuristics for the network design problem with connectivity requirements," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1461-1478, May.

    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. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.
    2. Anirudh Subramanyam & Frank Mufalli & José M. Lí?nez-Aguirre & Jose M. Pinto & Chrysanthos E. Gounaris, 2021. "Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty," Operations Research, INFORMS, vol. 69(1), pages 30-60, January.
    3. Curcio, Eduardo & Amorim, Pedro & Zhang, Qi & Almada-Lobo, Bernardo, 2018. "Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty," International Journal of Production Economics, Elsevier, vol. 202(C), pages 81-96.
    4. Shang, Xiaoting & Zhang, Guoqing & Jia, Bin & Almanaseer, Mohammed, 2022. "The healthcare supply location-inventory-routing problem: A robust approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    5. Michelle Blom & Slava Shekh & Don Gossink & Tim Miller & Adrian R Pearce, 2020. "Inventory routing for defense: Moving supplies in adversarial and partially observable environments," The Journal of Defense Modeling and Simulation, , vol. 17(1), pages 55-81, January.
    6. Agostinho Agra & Marielle Christiansen & Lars Magnus Hvattum & Filipe Rodrigues, 2018. "Robust Optimization for a Maritime Inventory Routing Problem," Transportation Science, INFORMS, vol. 52(3), pages 509-525, June.
    7. Zhang, Jie & Xie, Weijun & Sarin, Subhash C., 2021. "Robust multi-product newsvendor model with uncertain demand and substitution," European Journal of Operational Research, Elsevier, vol. 293(1), pages 190-202.
    8. Sun, Hao & Yang, Jun & Yang, Chao, 2019. "A robust optimization approach to multi-interval location-inventory and recharging planning for electric vehicles," Omega, Elsevier, vol. 86(C), pages 59-75.
    9. Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
    10. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2016. "Min–Max exact and heuristic policies for a two-echelon supply chain with inventory and transportation procurement decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 57-70.
    11. Filipe Rodrigues & Agostinho Agra & Cristina Requejo & Erick Delage, 2021. "Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 685-705, May.
    12. Seulgi Joung & Seyoung Oh & Kyungsik Lee, 2023. "Comparative analysis of linear programming relaxations for the robust knapsack problem," Annals of Operations Research, Springer, vol. 323(1), pages 65-78, April.
    13. Jianwen Ren & Yingqiang Xu & Shiyuan Wang, 2018. "A Distributed Robust Dispatch Approach for Interconnected Systems with a High Proportion of Wind Power Penetration," Energies, MDPI, vol. 11(4), pages 1-18, April.
    14. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    15. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    16. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    17. Li, Shukai & Liu, Ronghui & Yang, Lixing & Gao, Ziyou, 2019. "Robust dynamic bus controls considering delay disturbances and passenger demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 88-109.
    18. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    19. Kandpal, Bakul & Pareek, Parikshit & Verma, Ashu, 2022. "A robust day-ahead scheduling strategy for EV charging stations in unbalanced distribution grid," Energy, Elsevier, vol. 249(C).
    20. Guo, Shiliang & Li, Pengpeng & Ma, Kai & Yang, Bo & Yang, Jie, 2022. "Robust energy management for industrial microgrid considering charging and discharging pressure of electric vehicles," Applied Energy, Elsevier, vol. 325(C).

    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:229:y:2013:i:3:p:599-612. 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.