A branch and cut approach to the cardinality constrained circuit problem

Abstract

The Cardinality Constrained Circuit Problem (CCCP) is the problem of finding a minimum cost circuit in a graph where the circuit is constrained to have at most k edges. The CCCP is NP-Hard. We present classes of facet-inducing inequalities for the convex hull of feasible circuits, and a branch-and-cut solution approach using these inequalities. †Current… (More)
DOI: 10.1007/s101070100209

Topics

16 Figures and Tables

Slides referencing similar topics