Benders decomposition with combinatorial feasibility cuts, multiple-cut addition, clique-cover heuristic, and initial cut generation solves k-defensive domination instances on Erdos-Renyi, chordal, and Barabasi-Albert graphs that remain unsolved by classical formulations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Benders Decomposition Approach for the k-Defensive Domination Problem
Benders decomposition with combinatorial feasibility cuts, multiple-cut addition, clique-cover heuristic, and initial cut generation solves k-defensive domination instances on Erdos-Renyi, chordal, and Barabasi-Albert graphs that remain unsolved by classical formulations.