Pages that link to "Item:Q1142702"
From MaRDI portal
The following pages link to Strengthening cuts for mixed integer programs (Q1142702):
Displaying 46 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Composite lifting of group inequalities and an application to two-row mixing inequalities (Q429671) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Cut generation through binarization (Q896284) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- A converse for disjunctive constraints (Q1238749) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)
- Operations that Preserve the Covering Property of the Lifting Region (Q3454508) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
