Logical constraints as cardinality rules: Tight representation

DOI10.1023/B:JOCO.0000031413.33955.62zbMath1058.90051OpenAlexW2011051863MaRDI QIDQ1768603

Egon Balas

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000031413.33955.62

zbMATH Keywords

satisfiabilitylogical constraintscardinality rulespolyhedral representation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)

Related Items (1)

Ideal, non-extended formulations for disjunctive constraints admitting a network representation

This page was built for publication: Logical constraints as cardinality rules: Tight representation