Lift-and-project cuts for convex mixed integer nonlinear programs
From MaRDI portal
Publication:1697971
DOI10.1007/S12532-017-0118-1zbMATH Open1387.90159OpenAlexW2580483317MaRDI QIDQ1697971FDOQ1697971
Authors: Mustafa R. Kılınç, Jeff Linderoth, James 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
Recommendations
- Lift-and-project cuts for mixed integer convex programs
- Lifting for conic mixed-integer programming
- An optimality cut for mixed integer linear programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Cuts for Conic Mixed-Integer Programming
- scientific article; zbMATH DE number 437548
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- ``Binarize and project to generate cuts for general mixed-integer programs
- Partial convexification cuts for 0--1 mixed-integer programs
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Extended formulations in mixed integer conic quadratic programming
- Benchmarking optimization software with performance profiles.
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Strengthening cuts for mixed integer programs
- A polyhedral branch-and-cut approach to global optimization
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Title not available (Why is that?)
- The Cutting-Plane Method for Solving Convex Programs
- Title not available (Why is that?)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Valid inequalities for mixed integer linear programs
- Different transformations for solving non-convex trim-loss problems by MINLP
- Disjunctive Programming
- Optimizing over the first Chvátal closure
- Mixed integer second order cone programming.
- Split cuts and extended formulations for mixed integer conic quadratic programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- On optimizing over lift-and-project closures
- Optimizing over the split closure
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Conic mixed-integer rounding cuts
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Cuts for mixed 0-1 conic programming
- Large-Scale Network Topological Optimization
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- MIR closures of polyhedral sets
- MINTO, a Mixed INTeger Optimizer
- On the separation of disjunctive cuts
- A modified lift-and-project procedure
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Cutting planes from extended LP formulations
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- Computational experiments with cross and crooked cross cuts
Cited In (23)
- Extended multi-interval Legendre-Gauss-Radau pseudospectral method for mixed-integer optimal control problem in engineering
- On the facet defining inequalities of the mixed-integer bilinear covering set
- An L-shaped method with strengthened lift-and-project cuts
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- A quantum computing based numerical method for solving mixed-integer optimal control problems
- Outer approximation for integer nonlinear programs via decision diagrams
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Strong formulations for conic quadratic optimization with indicator variables
- A disjunctive cut strengthening technique for convex MINLP
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Disjunctive cuts in mixed-integer conic optimization
- Two-term disjunctions on the second-order cone
- Partially distributed outer approximation
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- 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
- On pathological disjunctions and redundant disjunctive conic cuts
- On optimizing over lift-and-project closures
Uses Software
This page was built for publication: Lift-and-project cuts for convex mixed integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697971)
