Monoidal strengthening and unique lifting in MIQCPs

DOI10.1007/978-3-031-32726-1_7MaRDI QIDQ6085991

Felipe Serrano, Gonzalo Muñoz, Antonia Chmiela

Publication date: 9 November 2023

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

zbMATH Keywords

MIQCPunique liftingmonoidal strengthening

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Cites Work

• Unique lifting of integer variables in minimal inequalities
• Strengthening cuts for mixed integer programs
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• The (not so) trivial lifting in two dimensions
• Two row mixed-integer cuts via lifting
• A Geometric Perspective on Lifting
• Maximal Quadratic-Free Sets
• The Convex Hull of a Quadratic Constraint over a Polytope
• Nonunique Lifting of Integer Variables in Minimal Inequalities
• Convex Analysis
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Convexity Cuts and Cut Search
• On the implementation and strengthening of intersection cuts for QCQPs

This page was built for publication: Monoidal strengthening and unique lifting in MIQCPs