Extended formulations for perfect domination problems and their algorithmic implications

DOI10.1016/J.EJOR.2023.03.022MaRDI QIDQ6113358zbMATH OpenFDO

Authors Vinicius L. do Forte, Saïd Hanafi, Abilio Lucena

Publication date 11 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.03.022

zbMATH Keywords

combinatorial optimizationcomputational resultsexact solution algorithmsmathematical formulationsperfect graph domination

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• A survey of the theory of hypercube graphs
• Algorithm 457: finding all cliques of an undirected graph
• An integer programming approach for fault-tolerant connected dominating sets
• Benchmarking optimization software with performance profiles.
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Dominating sets in n‐cubes
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2108952 (Why is no real title available?)
• scientific article; zbMATH DE number 933213 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• Modelling and solving the perfect edge domination problem
• On covering sets and error-correcting codes
• Perfect codes in graphs
• Perfect edge domination and efficient edge domination in graphs
• Perfect edge domination: hard and solvable cases
• Reducibility among combinatorial problems
• The weighted perfect domination problem and its variants
• Total domination in graphs

Cited in

(1)

• The weighted perfect domination problem and its variants

This page was built for publication: Extended formulations for perfect domination problems and their algorithmic implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113358)