Logical Constraints as Cardinality Rules: Tight Representation

Egon Balas

Journal of Combinatorial Optimization, 2004, vol. 8, issue 2, No 1, 115-128

Abstract: Abstract We derive by means of disjunctive programming the convex hull representation of logical conditions called cardinality rules given by Hong and Hooker (1999), and specify an efficient separation algorithm for the family of inequalities defining the convex hull. We then extend both the convex hull characterization and the efficient separation procedure to more general logical conditions.

Keywords: logical constraints; polyhedral representation; satisfiability; cardinality rules (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000031413.33955.62 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:2:d:10.1023_b:joco.0000031413.33955.62

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000031413.33955.62

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().