Lift-and-project cuts for mixed integer convex programs
From MaRDI portal
Recommendations
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A disjunctive cut strengthening technique for convex MINLP
- scientific article; zbMATH DE number 437548
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Aggregation and Mixed Integer Rounding to Solve MIPs
- An algorithmic framework for convex mixed integer nonlinear programs
- An in-out approach to disjunctive optimization
- Conic mixed-integer rounding cuts
- Convex programming for disjunctive convex optimization
- Cuts for mixed 0-1 conic programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Facets of the Knapsack Polytope From Minimal Covers
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Gomory cuts revisited
- Lift-and-project for mixed 0-1 programming: recent progress
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- On optimizing over lift-and-project closures
- On the separation of disjunctive cuts
- Strengthening cuts for mixed integer programs
- Testing cut generators for mixed-integer linear programming
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Cited in
(28)- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Lift-and-project cuts for convex mixed integer nonlinear programs
- 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
- Strong formulations for conic quadratic optimization with indicator variables
- A disjunctive cut strengthening technique for convex MINLP
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Intersection cuts for factorable MINLP
- On mathematical programming with indicator constraints
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- A partial outer convexification approach to control transmission lines
- On minimal valid inequalities for mixed integer conic programs
- scientific article; zbMATH DE number 2084778 (Why is no real title available?)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- ``Binarize and project to generate cuts for general mixed-integer programs
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Disjunctive cuts in mixed-integer conic optimization
- A computational study of perspective cuts
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- 50 years of mixed-integer nonlinear and disjunctive programming
- Depth-optimized convexity cuts
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Two-term disjunctions on the second-order cone
This page was built for publication: Lift-and-project cuts for mixed integer convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009750)
