Extended formulations for perfect domination problems and their algorithmic implications
From MaRDI portal
Publication:6113358
DOI10.1016/j.ejor.2023.03.022MaRDI QIDQ6113358
Abilio Lucena, Saïd Hanafi, Vinicius L. do Forte
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
combinatorial optimizationcomputational resultsmathematical formulationsexact solution algorithmsperfect graph domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of the theory of hypercube graphs
- Perfect edge domination and efficient edge domination in graphs
- Perfect edge domination: hard and solvable cases
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- The weighted perfect domination problem and its variants
- 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
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Total domination in graphs
- Dominating sets in n‐cubes
- Reducibility among Combinatorial Problems
- Algorithm 457: finding all cliques of an undirected graph
- Benchmarking optimization software with performance profiles.
This page was built for publication: Extended formulations for perfect domination problems and their algorithmic implications
