Skip to main content

A branch and cut approach to the cardinality constrained circuit problem

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: April 1998 / Accepted: October 2000¶Published online October 26, 2001

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100209