Open AccessTight representation of logical constraints as cardinality rules
Author(s) -
Hong Yan,
J. N. Hooker
Publication year - 1999
Publication title -
mathematical programming
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.358
H-Index - 131
eISSN - 1436-4646
pISSN - 0025-5610
DOI - 10.1007/s101070050061
Subject(s) - mathematics , cardinality (data modeling) , representation (politics) , discrete mathematics , algorithm , theoretical computer science , mathematical optimization , calculus (dental) , computer science , data mining , medicine , dentistry , politics , political science , law
1 ,...,Am are true, then at least ℓ of the propositions B1,...,Bn are true. The main result of the paper is that the procedure in fact provides a convex hull description.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom