Mixed-CUTS in Mixed-Integer Programming

• Mixed-CUTS are a class of cutting planes in mixed-integer programming, integrating classical approaches like Gomory and MIR cuts with extensions to disjunctive and conic models.
• They generalize traditional methods by incorporating irregular and domain-specific strategies, which can close up to 20% more integrality gap in branch-and-cut solvers.
• Leveraging both polyhedral theory and machine learning-driven selection policies, mixed-CUTS significantly improve conflict analysis, branching decisions, and overall solver efficiency.

Mixed-CUTS are a class of cutting planes and algorithmic strategies central to modern mixed-integer programming (MIP) and combinatorial optimization. The term encompasses multiple distinct yet related methodologies: (i) classical mixed-integer Gomory and mixed-integer rounding (MIR) cuts as drivers of MIP solver performance, (ii) their extensions to disjunctive, conic, supermodular, and learning-based frameworks, and (iii) highly-structured separation and selection algorithms leveraging both polyhedral and learning-theoretic principles. Recent work also identifies "irregular" mixed-CUTS not arising from standard intersection cuts or tableau formulations, highlighting the richness of the space. Since their inception, mixed-CUTS have seen significant theoretical and algorithmic advances, impacting exact MIP, branch-and-cut, conic optimization, SAT/MaxSAT via clause cuts, and core selection and conflict analysis.

1. Foundations: Mixed-Integer Rounding and Gomory Cuts

The prototypical mixed-CUT is the Gomory Mixed-Integer Cut (GMIC), also known as a mixed-integer rounding cut (MIR cut). For a standard-form MILP,

$$\min\ c^T x,\ \text{s.t.}\ A x \le b,\ \ell \le x \le u,\ x_j \in \mathbb{Z},\ j \in I,$$

the MIR cut arises from aggregating certain rows of the simplex tableau corresponding to a fractional basic solution. If a basic integer variable $x_r$ takes fractional value $\bar b_r$, the derived tableau row is

$x_r + \sum_{j \in N} \bar a_{rj} x_j = \bar b_r,$

and, denoting $f_0 = \{\bar b_r\}$, $f_j = \{\bar a_{rj}\}$, a valid MIR cut is, e.g.,

$$\sum_{j \in N} f_j x_j + \sum_{i \in B} \max\{0, f_i-f_0\} x_i \ge f_0,$$

where $B$ indexes basic integer slacks. In more general notation, MIR cuts can be constructed from any (not necessarily tableau) aggregation via dual multipliers, followed by coefficient rounding as a function of right-hand-side fractional parts (Eifler et al., 2023, Lee et al., 2015, Balcan et al., 2022). These cuts dominate the Chvátal–Gomory family in the 0–1 case due to their sharper coefficient adjustments and are provably the strongest pure-integer cuts for split disjunctions (Mexi et al., 2024).

2. Disjunctive and Irregular Mixed-CUTS

Beyond splits, mixed-CUTS generalize to arbitrary disjunctions and conic structures. The disjunctive approach constructs cuts valid for the convex hull of a union $D = \bigcup_h D_h$, where $D_h$ are polyhedral or conic sets, via cut-generating programs (CGLP or CGCP) with aggregation multipliers and normalization constraints (Balas et al., 2018, Lodi et al., 2019).

A key distinction emerges in lift-and-project or multi-term disjunctive settings: "regular" cuts correspond to intersection cuts from LP bases, whereas "irregular" cuts—detected via rank conditions or small MILPs—can express inequalities not recoverable from any intersection cut (Balas et al., 2018). Computational surveys over MIPLIB show that in $x_r$0-branch (non-split, $x_r$1) disjunctions, the majority of lift-and-project cuts are irregular and genuinely strengthen the regular cut closure, frequently closing up to 10–20% more integrality gap than split-derived cuts. These are crucial for modern cut pools in branch-and-cut solvers.

For mixed-integer conic programs (MI-conic), mixed-CUTS are generated via conic analogues of the Balas CGLP. Careful normalization is essential for solvability and duality. "Uniform" and "standard" normalizations guarantee strong duality and produce robust, sparse cuts that outperform LP lift-and-project in early separation rounds (Lodi et al., 2019).

3. Specialized Mixed-CUTS: Clause Cuts and Supermodular Cuts

Recent advances introduce mixed-CUTS tailored to structured domains:

• Clause Cuts (for MaxSAT/MILP): Clause Cuts, or clause-based Mixed-CUTS, are MILP-valid inequalities derived from arbitrary implied clauses of a CNF formula. At LP relaxations, integral variable assignments are fed to a SAT oracle; unsatisfiable assumptions yield core-minimized clause cuts, while learned clauses from CDCL can be scanned for further violating inequalities (Engelhardt et al., 25 Sep 2025). These cuts generalize "no-good" cuts, allowing direct encoding of powerful logical implications and effecting order-of-magnitude performance improvements over standard MILP and MaxSAT solvers on random SATLIB benchmarks.
• Supermodular/OA Cuts (for Mixed-Logit Assortment): In nonpolyhedral models, such as the Mixed-Logit assortment problem, OA+supermodular mixed-CUTS are derived from convex, supermodular functions of the form $x_r$2. Both first-order (outer-approximation) and set-function supermodular cuts yield MILP-valid constraints that tightly approximate the nonlinear feasible region, outperforming both classical MILP/CONIC relaxations in root-gap closed and round/runtime performance (Pham et al., 2024).

4. Machine Learning-Driven Mixed-CUTS: Cut Generation and Selection

Data-driven mixed-CUT frameworks address two core subroutines: separation (cut generation) and selection (cut pool curation):

4.1 Learning Constraint Screening for MIR/Mixed-CUTS

Since identifying the most violated MIR cut is computationally hard, one can learn, via a classifier on row statistics (raw slack, duals, coefficient structure, violation, etc.), which rows are likely to produce strong MIR cuts against a given fractional LP solution (Guaje et al., 2024). A gradient-boosted tree classifier, trained on per-row features over randomly perturbed instance families, reduces the constraint set size for separation—yielding tighter gaps in fewer rounds, especially for previously hard instances that defeated full separation. Accuracy, precision, and recall for identifying useful rows exceed 80–90%.

4.2 Learned Cut Selection Policies

Adaptive selection strategies—both score-based (weighted combinations of efficacy, support, objective parallelism, etc.) (Turner et al., 2022) and multiple-instance ranking (Huang et al., 2021)—have been enabled via graph convolutional and feedforward architectures. Empirically, even in highly heterogeneous environments, instance-specific cut selection policies trained via reinforcement learning or MIL significantly outperform any fixed heuristic, though the theoretical best remains substantially unattained. For industrial-scale deployments (e.g., daily MIPs with millions of rows), these ML cut selectors can yield mean speedups exceeding 12% with negligible overhead.

4.3 Theoretical Analysis of Learnability

The sensitivity of branch-and-cut trees to the choice of mixed-CUT parameters is controlled: as shown, for the family of GMICs, the structure of the search tree is piecewise-constant in parameters, with polynomially many regions (Balcan et al., 2022). The pseudo-dimension bounds for the function class mapping cut parameters to tree size enable uniform generalization; explicit sample complexity guarantees for ML-based cut parameter learning thus exist.

5. Conflict Analysis, Branching, and Mixed-CUT Integration

5.1 Cut-Based Conflict Analysis

Cut-based conflict analysis leverages mixed-integer rounding at the heart of conflict-driven clause learning: infeasible node derivations are resolved by a sequence of linear combinations and MIR reductions, generating new cuts that propagate and prune more effectively than classical CG (Chvátal–Gomory) or graph-based conflict clauses. Experiments on MIPLIB 2017 demonstrate that MIR-derived mixed-CUT conflicts induce twice as many propagations per node, hasten node elimination, and account for a 5–7% reduction in nodes and solve time in state-of-the-art SCIP (Mexi et al., 2024).

5.2 Bridging Cutting and Branching

Branching quality can be tightly coupled to cut quality: branching on the variable whose associated GMI cut has highest efficacy—a notion formalized and measured via the depth or efficacy of the corresponding cut at the current LP solution—often yields balanced trees competitive with strong branching, at zero additional overhead. Empirical results confirm that even a small additive weight on last GMI efficacy in the hybrid branching rule reduces node count and solve time by 4–8% over standard heuristics in state-of-the-art solvers (Turner et al., 2023).

6. Extensions: Quadratic, Conic, and Graph-Theoretic Mixed-CUTS

Mixed-CUTS extend to nonlinear and combinatorial structures:

• Concave Quadratic Cuts for MI-QCQP: For MIQCQP, valid concave quadratic inequalities derived from lattice properties (e.g., $x_r$3 for $x_r$4) are lifted into SDP relaxations as cuts, dramatically tightening root bounds, especially on integer least squares and max-cut problems (Park et al., 2015).
• Parameterized Mixed Graph Cuts: In network flow, the "mixed cut" problem generalizes Menger’s theorem: delete up to $x_r$5 vertices and $x_r$6 edges to disconnect specified terminals. The problem is NP-complete but fixed-parameter tractable via recursive understanding, with an algorithm operating in $x_r$7 time (Rai et al., 2015).

7. Computational Impact and Integration in Modern Solvers

Mixed-CUTS, both in their classical and most recent learning-augmented or domain-specialized forms, underpin state-of-the-art improvements in commercial and open-source MIP solvers. Verified (rational, VIPR-certified) variants enable provably correct solutions, closing up to 21.5% more instances and reducing overall solve times by 26.8% on large benchmarks (Eifler et al., 2023). Clause-based, OA/supermodular, and irregular disjunctive cuts—when selected or separated efficiently, including with ML—frequently dominate conventional approaches in bound-tightening, node-count, and total time metrics by up to two orders of magnitude in structured domains (Engelhardt et al., 25 Sep 2025, Pham et al., 2024).

These advances, along with deep connections between cut-based separation, conflict analysis, and branching, demonstrate that mixed-CUTS remain a fertile axis of algorithmic, theoretical, and applied research in combinatorial optimization, with robust generalization properties and growing relevance in data-driven environments.