On the implementation and strengthening of intersection cuts for QCQPs
From MaRDI portal
Publication:5918425
DOI10.1007/978-3-030-73879-2_10zbMath1482.90131OpenAlexW3123307255MaRDI QIDQ5918425
Antonia Chmiela, Felipe Serrano, Gonzalo Muñoz
Publication date: 21 December 2021
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-73879-2_10
Related Items (4)
Monoidal strengthening and unique lifting in MIQCPs ⋮ Towards a characterization of maximal quadratic-free sets ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Maximal quadratic-free sets
Cites Work
- Unnamed Item
- Sufficiency of cut-generating functions
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- SCIP: solving constraint integer programs
- Split cuts and extended formulations for mixed integer conic quadratic programming
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Intersection cuts for polynomial optimization
- Intersection cuts for factorable MINLP
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- Minimal Valid Inequalities for Integer Constraints
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Intersection Cuts for Bilevel Optimization
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Facet inequalities from simple disjunctions in cutting plane theory
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Polyhedral convexity cuts and negative edge extensions
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Maximal Quadratic-Free Sets
- The Convex Hull of a Quadratic Constraint over a Polytope
- Cut-Generating Functions and S-Free Sets
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- Convexity Cuts and Cut Search
- On the implementation and strengthening of intersection cuts for QCQPs
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: On the implementation and strengthening of intersection cuts for QCQPs
