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

Stable set reformulations for the degree preserving spanning tree problem

Author

Listed:
  • Lucena, Abílio
  • Salles da Cunha, Alexandre

Abstract

Let G=(V,E) be a connected undirected graph and assume that a spanning tree is available for it. Any vertex in this tree is called degree preserving if it has the same degree in the graph and in the tree. Building upon this concept, the Degree Preserving Spanning Tree Problem (DPSTP) asks for a spanning tree of G with as many degree preserving vertices as possible. DPSTP is very much intertwined with the most important application for it, so far, i.e., the online monitoring of arc flows in a water distribution network, what serves us as an additional motivation for our investigation. We show that degree preserving vertices correspond to a stable set of a properly defined DPSTP conflict graph. This, in turn, allows us to use valid inequalities for the Stable Set Polytope (SSP) and thus strengthen the DPSTP formulations previously suggested in the literature. In doing so, the Branch-and-cut and Benders Decomposition algorithms suggested for these formulations are greatly enhanced. Additionally, as a further contribution, we also introduce a new and very challenging set of DPSTP test instances, given by graphs that closely resemble water distribution networks. For these instances, the new algorithms very clearly outperform all previous DPSTP algorithms. They not only run faster than their competitors but are also less dependent on good initial DPSTP primal bounds. For previous DPSTP test sets, the new algorithms lag behind the best existing algorithm for them, which is based on Lagrangian relaxation. However, as compared to additional DPSTP previous algorithms that do not benefit from SSP inequalities, the new ones come much closer to the Lagrangian relaxation one.

Suggested Citation

  • Lucena, Abílio & Salles da Cunha, Alexandre, 2024. "Stable set reformulations for the degree preserving spanning tree problem," European Journal of Operational Research, Elsevier, vol. 319(1), pages 50-61.
  • Handle: RePEc:eee:ejores:v:319:y:2024:i:1:p:50-61
    DOI: 10.1016/j.ejor.2024.06.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724005113
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.06.031?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. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    2. Ali Haghighi & Hossein Samani & Zeinab Samani, 2011. "GA-ILP Method for Optimization of Water Distribution Networks," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 25(7), pages 1791-1808, May.
    3. Atamturk, Alper & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "Conflict graphs in solving integer programming problems," European Journal of Operational Research, Elsevier, vol. 121(1), pages 40-55, February.
    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. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    2. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    3. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    4. Jérémy Omer & Michael Poss, 2021. "Identifying relatively irreducible infeasible subsystems of linear inequalities," Annals of Operations Research, Springer, vol. 304(1), pages 361-379, September.
    5. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    6. William B. Haskell & Wenjie Huang & Huifu Xu, 2018. "Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions," Papers 1805.06632, arXiv.org.
    7. Clavijo López, Christian & Crama, Yves & Pironet, Thierry & Semet, Frédéric, 2024. "Multi-period distribution networks with purchase commitment contracts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 556-572.
    8. Avci, Mualla Gonca & Avci, Mustafa & Battarra, Maria & Erdoğan, Güneş, 2024. "The wildfire suppression problem with multiple types of resources," European Journal of Operational Research, Elsevier, vol. 316(2), pages 488-502.
    9. Álvaro Porras & Concepción Domínguez & Juan Miguel Morales & Salvador Pineda, 2023. "Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1454-1469, November.
    10. David Bergman & Carlos H. Cardonha & Andre A. Cire & Arvind U. Raghunathan, 2019. "On the Minimum Chordal Completion Polytope," Operations Research, INFORMS, vol. 67(2), pages 532-547, March.
    11. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    12. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric & Van Woensel, Tom, 2020. "A Benders decomposition-based approach for logistics service network design," European Journal of Operational Research, Elsevier, vol. 286(2), pages 523-537.
    13. J. Yazdi, 2016. "Decomposition based Multi Objective Evolutionary Algorithms for Design of Large-Scale Water Distribution Networks," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 30(8), pages 2749-2766, June.
    14. M. Pasha & Kevin Lansey, 2014. "Strategies to Develop Warm Solutions for Real-Time Pump Scheduling for Water Distribution Systems," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 28(12), pages 3975-3987, September.
    15. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
    16. Dursun, Pınar & Taşkın, Z. Caner & Altınel, İ. Kuban, 2019. "The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)," European Journal of Operational Research, Elsevier, vol. 272(1), pages 372-388.
    17. Weckenborg, Christian & Schumacher, Patrick & Thies, Christian & Spengler, Thomas S., 2024. "Flexibility in manufacturing system design: A review of recent approaches from Operations Research," European Journal of Operational Research, Elsevier, vol. 315(2), pages 413-441.
    18. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    19. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
    20. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.

    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:319:y:2024:i:1:p:50-61. 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.