Strengthening cuts for mixed integer programs
From MaRDI portal
Publication:1142702
DOI10.1016/0377-2217(80)90106-XzbMath0439.90064OpenAlexW2041873708MaRDI QIDQ1142702
Robert G. Jeroslow, Egon Balas
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90106-x
Related Items
Intersection cuts for single row corner relaxations, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Operations that Preserve the Covering Property of the Lifting Region, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, Computing deep facet-defining disjunctive cuts for mixed-integer programming, Two row mixed-integer cuts via lifting, Theoretical challenges towards cutting-plane selection, On optimizing over lift-and-project closures, Unique lifting of integer variables in minimal inequalities, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, Disjunctive cuts in mixed-integer conic optimization, Monoidal strengthening and unique lifting in MIQCPs, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Cut generation through binarization, Generalized intersection cuts and a new cut generating paradigm, On the Practical Strength of Two-Row Tableau Cuts, Lift-and-project cuts for convex mixed integer nonlinear programs, Composite lifting of group inequalities and an application to two-row mixing inequalities, Monoidal cut strengthening revisited, A note on the split rank of intersection cuts, Intersection cuts from multiple rows: a disjunctive programming approach, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Strong-branching inequalities for convex mixed integer nonlinear programs, Can Cut-Generating Functions Be Good and Efficient?, Lift-and-Project Cuts for Mixed Integer Convex Programs, A brief history of lift-and-project, A relax-and-cut framework for Gomory mixed-integer cuts, Lift-and-project for mixed 0-1 programming: recent progress, On the separation of disjunctive cuts, Elementary closures for integer programs., Partial convexification cuts for 0--1 mixed-integer programs, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, A converse for disjunctive constraints, The (not so) trivial lifting in two dimensions, Valid inequalities for mixed integer linear programs, Lifting convex inequalities for bipartite bilinear programs, Cutting-plane theory: Algebraic methods, Lifting convex inequalities for bipartite bilinear programs, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, When Lift-and-Project Cuts Are Different, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty, A geometric approach to cut-generating functions, On mathematical programming with indicator constraints, Depth-optimized convexity cuts, Projection, lifting and extended formulation integer and combinatorial optimization, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- Unnamed Item
- Unnamed Item
- Disjunctive programming: Properties of the convex hull of feasible points
- Some polyhedra related to combinatorial problems
- Cutting-planes for programs with disjunctive constraints
- Polyhedral annexation in mixed integer and combinatorial programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
