Cardinality constrained minimum cut prob
β
Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott
π
Article
π
2004
π
Elsevier Science
π
English
β 377 KB
In several applications the solutions of combinatorial optimization problems (COP) are required to satisfy an additional cardinality constraint, that is to contain a ΓΏxed number of elements. So far the family of (COP) with cardinality constraints has been little investigated. The present work tackle