Lift-and-project cuts for convex mixed integer nonlinear programs
From MaRDI portal
Publication:1697971
DOI10.1007/s12532-017-0118-1zbMath1387.90159OpenAlexW2580483317MaRDI QIDQ1697971
Mustafa R. Kılınç, Jeff Linderoth, James R. Luedtke
Publication date: 21 February 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-017-0118-1
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
A quantum computing based numerical method for solving mixed-integer optimal control problems, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, A disjunctive cut strengthening technique for convex MINLP, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Disjunctive cuts in mixed-integer conic optimization, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, 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, How to convexify the intersection of a second order cone and a nonconvex quadratic, Outer approximation for integer nonlinear programs via decision diagrams, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Strong formulations for conic quadratic optimization with indicator variables, On pathological disjunctions and redundant disjunctive conic cuts, Partially distributed outer approximation, An L-shaped method with strengthened lift-and-project cuts, Extended multi-interval Legendre-Gauss-Radau pseudospectral method for mixed-integer optimal control problem in engineering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cutting planes from extended LP formulations
- On the separation of disjunctive cuts
- MIR closures of polyhedral sets
- Conic mixed-integer rounding cuts
- Optimizing over the first Chvátal closure
- Valid inequalities for mixed integer linear programs
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Strengthening cuts for mixed integer programs
- Different transformations for solving non-convex trim-loss problems by MINLP
- An improved branch and bound algorithm for mixed integer nonlinear programs
- MINTO, a Mixed INTeger Optimizer
- A modified lift-and-project procedure
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Extended formulations in mixed integer conic quadratic programming
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A polyhedral branch-and-cut approach to global optimization
- Split cuts and extended formulations for mixed integer conic quadratic programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- On optimizing over lift-and-project closures
- Optimizing over the split closure
- Perspective cuts for a class of convex 0-1 mixed integer programs
- 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
- Computational Experiments with Cross and Crooked Cross Cuts
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- The Cutting-Plane Method for Solving Convex Programs
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Large-Scale Network Topological Optimization
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Benchmarking optimization software with performance profiles.
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
