A characterization of maximal homogeneous-quadratic-free sets
Gonzalo Mu\~noz, Joseph Paat, Felipe Serrano

TL;DR
This paper characterizes maximal homogeneous-quadratic-free sets, extending the intersection cut framework to non-linear quadratic inequalities and providing a broader class of maximal sets through a new geometric characterization.
Contribution
It introduces a new characterization of maximal quadratic-free sets using non-expansive functions and sequences, broadening the understanding of $S$-free sets beyond linear cases.
Findings
Maximal quadratic-free sets are generated by non-expansive functions.
Every full-dimensional maximal quadratic-free set corresponds to some generating function.
The new characterization applies to general $S$-free sets beyond quadratic inequalities.
Abstract
The intersection cut framework was introduced by Balas in 1971 as a method for generating cutting planes in integer optimization. In this framework, one uses a full-dimensional convex -free set, where is the feasible region of the integer program, to derive a cut separating from a non-integral vertex of a linear relaxation of . Among all -free sets, it is the inclusion-wise maximal ones that yield the strongest cuts. Recently, this framework has been extended beyond the integer case in order to obtain cutting planes in non-linear settings. In this work, we consider the specific setting when is defined by a homogeneous quadratic inequality. In this 'quadratic-free' setting, every function , where is the unit disk in , generates a representation of a quadratic-free set. While not every generates a maximal quadratic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Optimization and Packing Problems
