Pages that link to "Item:Q1104856"
From MaRDI portal
The following pages link to A simplification for some disjunctive formulations (Q1104856):
Displaying 18 items.
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
- Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
- An alternative explanation of disjunctive formulations (Q1319581) (← links)
- On unions and dominants of polytopes (Q1434071) (← links)
- Eliminating disjunctions by disjunction elimination (Q1688959) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- Representation for multiple right-hand sides (Q2638974) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
