Maximal Quadratic-Free Sets

DOI10.1007/978-3-030-45771-6_24zbMath1503.90078OpenAlexW3022658014MaRDI QIDQ5041754

Gonzalo Muñoz, Felipe Serrano

Publication date: 14 October 2022

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-45771-6_24

zbMATH Keywords

intersection cut\(S\)-free setsnon-convex quadratic

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (10)

On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Monoidal strengthening and unique lifting in MIQCPs ⋮ Towards a characterization of maximal quadratic-free sets ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ On a generalization of the Chvátal-Gomory closure ⋮ Maximal quadratic-free sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficiency of cut-generating functions
• Cutting planes from extended LP formulations
• How to convexify the intersection of a second order cone and a nonconvex quadratic
• Motzkin decomposition of closed convex sets
• Two-term disjunctions on the second-order cone
• Equivalence between intersection cuts and the corner polyhedron
• Split cuts and extended formulations for mixed integer conic quadratic programming
• Maximal quadratic-free sets
• 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 pathological disjunctions and redundant disjunctive conic cuts
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• Global Optimization with Polynomials and the Problem of Moments
• On Minimal Valid Inequalities for Mixed Integer Conic Programs
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• On Maximal S-Free Convex Sets
• 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
• Integer Programming
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• Cut-Generating Functions and S-Free Sets
• Nonunique Lifting of Integer Variables in Minimal Inequalities
• 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
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

This page was built for publication: Maximal Quadratic-Free Sets