Lift-and-Project Cuts for Mixed Integer Convex Programs
From MaRDI portal
Publication:3009750
DOI10.1007/978-3-642-20807-2_5zbMath1339.90243OpenAlexW110732949MaRDI QIDQ3009750
Publication date: 24 June 2011
Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_5
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Convex hull of two quadratic or a conic quadratic and a quadratic inequality, A disjunctive cut strengthening technique for convex MINLP, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Disjunctive cuts in mixed-integer conic optimization, A partial outer convexification approach to control transmission lines, Two-term disjunctions on the second-order cone, Lift-and-project cuts for convex mixed integer nonlinear programs, On the facet defining inequalities of the mixed-integer bilinear covering set, Submodularity in Conic Quadratic Mixed 0–1 Optimization, How to convexify the intersection of a second order cone and a nonconvex quadratic, Mixed integer programming with a class of nonlinear convex constraints, Intersection cuts for convex mixed integer programs from translated cones, Split cuts and extended formulations for mixed integer conic quadratic programming, Disjunctive cuts for cross-sections of the second-order cone, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Strong formulations for conic quadratic optimization with indicator variables, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On mathematical programming with indicator constraints
Uses Software
Cites Work
- On the separation of disjunctive cuts
- Lift-and-project for mixed 0-1 programming: recent progress
- Testing cut generators for mixed-integer linear programming
- Conic mixed-integer rounding cuts
- An algorithmic framework for convex mixed integer nonlinear programs
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Strengthening cuts for mixed integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On optimizing over lift-and-project closures
- Gomory cuts revisited
- Cuts for mixed 0-1 conic programming
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- An In-Out Approach to Disjunctive Optimization
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Facets of the Knapsack Polytope From Minimal Covers
