Lifting inequalities: a framework for generating strong cuts for nonlinear programs
From MaRDI portal
Publication:847822
DOI10.1007/S10107-008-0226-9zbMATH Open1184.90130OpenAlexW1997826608MaRDI QIDQ847822FDOQ847822
Authors: Jean-Philippe Richard, Mohit Tawarmalani 
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0226-9
Recommendations
- Linear-programming-based lifting and its application to primal cutting-plane algorithms
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- scientific article; zbMATH DE number 4068611
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Stronger linear programming relaxations of max-cut
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- The 0-1 knapsack problem with a single continuous variable
- Convex extensions and envelopes of lower semi-continuous functions
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- On the facets of the mixed-integer knapsack polyhedron
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Sequence independent lifting in mixed integer programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- On the facial structure of set packing polyhedra
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new reformulation-linearization technique for bilinear programming problems
- A polyhedral study of nonconvex quadratic programs with box constraints
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- MIP: Theory and practice -- closing the gap
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Valid Linear Inequalities for Fixed Charge Problems
- Flow pack facets of the single node fixed-charge flow polytope
- Facets of the Complementarity Knapsack Polytope
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Title not available (Why is that?)
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Valid inequalities and separation for uncapacitated fixed charge networks
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Title not available (Why is that?)
- Box-constrained quadratic programs with fixed charge variables
Cited In (21)
- Title not available (Why is that?)
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- Cutting planes for the multistage stochastic unit commitment problem
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Deriving convex hulls through lifting and projection
- A graph-based decomposition method for convex quadratic optimization with indicators
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Explicit convex and concave envelopes through polyhedral subdivisions
- Strong formulations for conic quadratic optimization with indicator variables
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Lifting for conic mixed-integer programming
- On interval-subgradient and no-good cuts
- Supermodularity and valid inequalities for quadratic optimization with indicators
- On the convexification of constrained quadratic optimization problems with indicator variables
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Ideal formulations for constrained convex optimization problems with indicator variables
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
Uses Software
This page was built for publication: Lifting inequalities: a framework for generating strong cuts for nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847822)
