Horn cardinality rules.pdf.pdf' (726.85 kB)
Download file

Horn cardinality rules

Download (726.85 kB)
journal contribution
posted on 23.09.2007, 00:00 by John N. Hooker, Hong Yan, Carnegie Mellon University.Engineering Design Research Center.
Abstract: "We address the problem of finding a 'tight' representation of Horn cardinality rules in a mixed integer programming model by describing a convex hull of it. A cardinality Horn rule asserts that if at least k of the propositions AΓéü,...,A[subscript m] are true, then B is true. We also show that Horn cardinality rules have properties analogous to ordinary Horn rules."




Usage metrics