Pages that link to "Item:Q1300274"
From MaRDI portal
The following pages link to Tight representation of logical constraints as cardinality rules (Q1300274):
Displaying 16 items.
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- On the system of two all different\(\_\)predicates (Q1041730) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- A strategic model for supply chain design with logical constraints: Formulation and solution. (Q1422373) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Logical constraints as cardinality rules: Tight representation (Q1768603) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- On the implication problem for cardinality constraints and functional dependencies (Q2349821) (← links)
- Submodularity and its application to some global constraints (Q2364363) (← links)
- A polyhedral approach to the \textit{alldifferent} system (Q2429475) (← links)
- Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic (Q6572729) (← links)
