The minimum weakly connected independent set problem: Polyhedral results and Branch–and–Cut
Under an Elsevier user license
open archive
Keywords
Weakly connected independent set
Polytopes
Valid inequalities
Graph operations
Branch-and-Cut
Cited by (0)
© 2016 Elsevier B.V.