Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
From MaRDI portal
Publication:5962729
DOI10.1007/s10107-015-0866-5zbMath1358.90078arXiv1302.2556OpenAlexW2029715007MaRDI QIDQ5962729
Mustafa R. Kılınç, Juan Pablo Vielma, Sina Modaresi
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2556
mixed integer nonlinear programming\(k\)-branch splitaggregation techniqueconic quadratic setsinterpolation techniqueintersection cutssplit
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximal Quadratic-Free Sets, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, On sublinear inequalities for mixed integer conic programs, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, Strong formulations for quadratic optimization with M-matrices and indicator variables, Disjunctive cuts in mixed-integer conic optimization, Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective, Towards a characterization of maximal quadratic-free sets, Two-term disjunctions on the second-order cone, Outer-product-free sets for polynomial optimization and oracle-based cuts, 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, A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization, Intersection cuts for convex mixed integer programs from translated cones, Split cuts and extended formulations for mixed integer conic quadratic programming, Strong formulations for conic quadratic optimization with indicator variables, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Ideal formulations for constrained convex optimization problems with indicator variables, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15--17, 2011. Proceedings
- A note on the MIR closure and basic relaxations of polyhedra
- Handbook on semidefinite, conic and polynomial optimization
- Semidefinite representation of convex hulls of rational varieties
- Convex hulls of curves of genus one
- Extending the QCR method to general mixed-integer programs
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- SCIP: solving constraint integer programs
- Conic mixed-integer rounding cuts
- Chvátal closures for mixed integer programming problems
- Cook, Kannan and Schrijver's example revisited
- Equivalence between intersection cuts and the corner polyhedron
- Integer programming and combinatorial optimization. 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9--11, 2010. Proceedings
- Valid inequalities for mixed integer linear programs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming relaxations for semialgebraic problems
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Split closure and intersection cuts
- Split cuts and extended formulations for mixed integer conic quadratic programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Generalized intersection cuts and a new cut generating paradigm
- A branch-and-cut method for 0-1 mixed convex programming
- The split closure of a strictly convex body
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Cuts for mixed 0-1 conic programming
- A constructive characterization of the split closure of a mixed integer linear program
- Global Optimization with Polynomials and the Problem of Moments
- Semidefinite Representation of Convex Sets and Convex Hulls
- Convex Hulls of Algebraic Sets
- The Chvátal-Gomory Closure of a Strictly Convex Body
- On the convex hull of a space curve
- The Convex Hull of a Variety
- Computational Experiments with Cross and Crooked Cross Cuts
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- On the Chvátal-Gomory Closure of a Compact Convex Set
- A New Approach to the Stable Set Problem Based on Ellipsoids
- ORBITOPES
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Outline of an algorithm for integer solutions to linear programs
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Convex hull of two quadratic constraints is an LMI set
- Polyhedral Approaches to Mixed Integer Linear Programming
- Mixed Integer Programming Computation
- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- A Strong Dual for Conic Mixed-Integer Programs
- Semidefinite Optimization and Convex Algebraic Geometry
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Cuts for Conic Mixed-Integer Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- A Survey of the S-Lemma
- Relaxations of mixed integer sets from lattice-free polyhedra
