Tight representation of logical constraints as cardinality rules

DOI10.1007/s101070050061zbMath0954.90043OpenAlexW2079086864MaRDI QIDQ1300274

Hong Yan, John N. Hooker

Publication date: 9 February 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Tight_representation_of_logical_constraints_as_cardinality_rules/6708872

zbMATH Keywords

linear relaxationmathematical programming modelconvex hull descriptionlogical constraints in inequality form

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Classical propositional logic (03B05)

Related Items (11)

Cardinality constraints and systems of restricted representatives ⋮ Constraint programming and operations research ⋮ Submodularity and its application to some global constraints ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ A polyhedral approach to the \textit{alldifferent} system ⋮ A strategic model for supply chain design with logical constraints: Formulation and solution. ⋮ Mass Customization and “Forecasting Options’ Penetration Rates Problem” ⋮ Modelling either-or relations in integer programming ⋮ On the system of two all different\(\_\)predicates ⋮ Graph coloring inequalities from all-different systems ⋮ Formulating logical implications in combinatorial optimisation

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