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

Extended formulations for perfect domination problems and their algorithmic implications

Author

Listed:
  • do Forte, Vinicius L.
  • Hanafi, Saïd
  • Lucena, Abilio

Abstract

Given an undirected graph G=(V,E), a subset D⊆V is called a vertex dominating set (VDS) if every vertex of V either belongs to D or is adjacent to a vertex of D. Additionally, a VDS D is called perfect if every vertex of V∖D is adjacent to a single vertex of D. Finally, the Perfect Vertex Domination Problem (PVDP) asks for a perfect VDS D with the smallest cardinality possible. Domination extends very naturally to the edges of G=(V,E) and the Perfect Edge Domination Problem (PEDP) asks for a perfect edge dominating set with as few edges as possible. We propose new formulations for PVDP and PEDP. They rely on structural properties of perfect dominating sets and are computationally compared with their counterparts from the literature. For the new PEDP formulation, in particular, running times for standard state-of-the-art mixed integer programming codes are shown to frequently lead to speed-ups of orders of magnitude, over their corresponding performances for the remaining PEDP formulations.

Suggested Citation

  • do Forte, Vinicius L. & Hanafi, Saïd & Lucena, Abilio, 2023. "Extended formulations for perfect domination problems and their algorithmic implications," European Journal of Operational Research, Elsevier, vol. 310(2), pages 566-581.
    • Handle: RePEc:eee:ejores:v:310:y:2023:i:2:p:566-581
    DOI: 10.1016/j.ejor.2023.03.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723002291
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.03.022?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. Austin Buchanan & Je Sang Sung & Sergiy Butenko & Eduardo L. Pasiliao, 2015. "An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 178-188, February.
    3. Bernard Gendron & Abilio Lucena & Alexandre Salles da Cunha & Luidi Simonetti, 2014. "Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 645-657, November.
    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. Hamidreza Validi & Austin Buchanan, 2020. "The Optimal Design of Low-Latency Virtual Backbones," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 952-967, October.
    2. Xinyun Wu & Zhipeng Lü & Fred Glover, 2022. "A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 817-833, March.
    3. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.
    4. Xiangyong Li & Y. P. Aneja, 2020. "A new branch-and-cut approach for the generalized regenerator location problem," Annals of Operations Research, Springer, vol. 295(1), pages 229-255, December.
    5. 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.
    6. Hosseinali Salemi & Austin Buchanan, 2022. "Solving the Distance-Based Critical Node Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1309-1326, May.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    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:310:y:2023:i:2:p:566-581. 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.