Towards a characterization of maximal quadratic-free sets

DOI10.1007/978-3-031-32726-1_24zbMath1528.90285arXiv2211.05185MaRDI QIDQ6086012

Gonzalo Muñoz, Felipe Serrano, Joseph Paat

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.05185

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Duality for mixed-integer convex minimization
• Optimality certificates for convex minimization and Helly numbers
• A proof of Lovász's theorem on maximal lattice-free sets
• Maximal quadratic-free sets
• Constructing lattice-free gradient polyhedra in dimension two
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Intersection cuts for polynomial optimization
• Two row mixed-integer cuts via lifting
• Maximal $S$-Free Convex Sets and the Helly Number
• On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• A Geometric Perspective on Lifting
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Integer Programming
• Approximation of Corner Polyhedra with Families of Intersection Cuts
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• Maximal Quadratic-Free Sets
• Cut-Generating Functions and S-Free Sets
• Nonunique Lifting of Integer Variables in Minimal Inequalities
• Inequalities from Two Rows of a Simplex Tableau
• Convex Analysis
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• On the implementation and strengthening of intersection cuts for QCQPs
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets