|Version 15 (modified by lou, 3 years ago) (diff)|
Contributor: Marta Eso
Maintainer: Laszlo Ladanyi, ladanyi@…
Generates cuts of the form (sum of a set of binary variables) <= 1.
(Note: This implementation is very fast, but designed for set partitioning problems. A more general purpose implementation would be welcome.)
Papers, Presentations, and References
- M. Eso, Parallel branch and cut for set partitioning, Ph.D. thesis, Cornell University, 1999. This is the best reference for CglClique. It describes the implementation in addition to the theory.
- Hoffman, K. and Padberg, M., "Solving Airline Crew Scheduling Problems by Branch-and-Cut", Management Science 39(6), June, 1993. Algorithms only, and not specific to this implementation.
Documentation and Bug Reports
See the section "Project Links" on the Cgl main Trac page.