Tight Representation of Logical Constraints as Cardinality RulesMathematical Programming
Date of Original Version6-1-1995
Abstract or Description
We address the problem of finding a "tight" representation of complex logical constraints in a mixed integer programming model by describing a convex hull representation of cardinality rules.
Citation InformationJohn N. Hooker and Hong Yan. "Tight Representation of Logical Constraints as Cardinality Rules" Mathematical Programming Vol. 85 (1995) p. 363 - 377
Available at: http://works.bepress.com/jnhooker/76/