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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: April 1998 / Accepted: October 2000¶Published online October 26, 2001
Rights and permissions
About this article
Cite this article
Bauer, P., Linderoth, J. & Savelsbergh, M. A branch and cut approach to the cardinality constrained circuit problem. Math. Program. 91, 307–348 (2002). https://doi.org/10.1007/s101070100209
Issue Date:
DOI: https://doi.org/10.1007/s101070100209