On disjunction convex hulls by big-M lifting
From MaRDI portal
Publication:6982350
Cites work
- A disjunctive cut strengthening technique for convex MINLP
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A simplification for some disjunctive formulations
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Convex Polytopes
- Disjunctive cuts for continuous linear bilevel programming
- Disjunctive cuts in mixed-integer conic optimization
- Disjunctive programming
- Disjunctive Programming
- Gaining or losing perspective
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 2107839 (Why is no real title available?)
- Integer Programming
- Lectures on Polytopes
- Mixed integer linear programming formulation techniques
- On disjunction convex hulls by lifting
- On the convex hull of the union of certain polyhedra
- On the MIR Closure of Polyhedra
- Representation for multiple right-hand sides
- Two-term disjunctions on the second-order cone
- Valid inequalities for mixed integer linear programs
This page was built for publication: On disjunction convex hulls by big-\(\mathrm{M}\) lifting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982350)