CoCo-MILP: Contrastive & Competitive MILP Prediction

• The paper introduces CoCo-MILP, which uses an Inter-Variable Contrastive Loss to enforce a ranking margin between binary decision variables.
• It incorporates an Intra-Constraint Competitive GNN layer to prevent over-smoothing by explicitly modeling competition among variables within constraints.
• Experimental results show up to 68.12% primal-gap reduction and faster convergence compared to traditional MILP solvers and related ML approaches.

Searching arXiv for the target paper and closely related MILP solution-prediction papers to ground the article and retrieve citation IDs. First, I’ll find the CoCo-MILP paper by its arXiv id. Now I’ll search for related papers mentioned in the provided data, such as Predict-and-Search, ConPS, Apollo-MILP, and DiffILO, so any contextual mentions can be cited accurately. CoCo-MILP is a learning-based framework for Mixed-Integer Linear Programming (MILP) solution prediction that addresses two structural misalignments identified in prior Graph Neural Network (GNN) approaches: an objective-level misalignment induced by Binary Cross-Entropy (BCE), and an architecture-level misalignment induced by smoothing in standard message passing. Introduced in "CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction" (Pu et al., 12 Nov 2025), it combines an Inter-Variable Contrastive Loss (VCL) with an Intra-Constraint Competitive (ICC) GNN layer to produce higher-quality predictions for binary decision variables, which are then used within a predict-and-search solver pipeline. The method is positioned within the MILP solution-prediction line of ML for combinatorial optimization alongside Neural Diving, Predict-and-Search (PS), ConPS, Apollo-MILP, and DiffILO (Pu et al., 12 Nov 2025).

1. Problem setting and motivation

Mixed-Integer Linear Programming is presented as a central modeling tool for combinatorial optimization. A MILP instance $\mathcal{I}$ is given as

$\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$

with objective coefficients $\bm{c}$, constraint matrix $\bm{A}$, right-hand side vector $\bm{b}$, and bounds $\bm{l}, \bm{u}$ (Pu et al., 12 Nov 2025). The paper focuses on the practically important case

$\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$

with general integers handled by standard preprocessing (Pu et al., 12 Nov 2025).

The motivation is computational rather than purely predictive. Even when all integer variables are binary, solving large-scale MILPs via Branch-and-Bound or Branch-and-Cut is NP-hard, and modern solvers such as SCIP and Gurobi can still struggle on large or industrial instances (Pu et al., 12 Nov 2025). A prominent ML4CO approach therefore uses GNNs to predict solutions or variable assignments and then allows a solver to refine them. The standard recipe is to represent the MILP as a bipartite graph, train a GNN to output $\hat{x}_j \in [0,1]$ as estimated marginals $p(x_j=1\mid \mathcal{I})$ for binary variables, and use these predictions as warm starts or to restrict the solver to a trust region around $\hat{\bm{x}}$ (Pu et al., 12 Nov 2025).

CoCo-MILP argues that existing solution-prediction methods are structurally misaligned with MILP instances at two levels. At the objective level, BCE treats each variable as an independent binary classification, ignoring that solution quality depends on relative priorities among variables, yielding plausibly calibrated but ambiguously ordered logits (Pu et al., 12 Nov 2025). At the architecture level, standard bipartite GNN message passing smooths node representations, whereas many MILP constraints express competition, such as set-packing $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$0, budget or knapsack constraints $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$1, and assignment constraints $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$2 (Pu et al., 12 Nov 2025). The central thesis is therefore that high-quality MILP solution prediction requires both inter-variable contrast and intra-constraint competition.

2. Predict-and-search formulation and graph encoding

Within the Predict-and-Search paradigm, CoCo-MILP adopts an energy-based solution distribution

$\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$3

and approximates it by a factorized distribution over binary variables,

$\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$4

with a GNN producing $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$5, where $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$6 (Pu et al., 12 Nov 2025). This factorization is explicitly a modeling approximation. The paper later notes that the underlying distribution model remains fully factorized over binary variables, even though VCL injects relational structure at the loss level (Pu et al., 12 Nov 2025).

At inference, the framework reuses the search stage of PS through a trust-region formulation: $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$7 with

$\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$8

The search pipeline chooses hyperparameters $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$9 to fix top-$\bm{c}$0 variables with highest probabilities to $\bm{c}$1, potentially some to $\bm{c}$2, possibly unfix top-$\bm{c}$3 with low confidence, and constrain $\bm{c}$4 before solving the restricted MILP using Gurobi or SCIP for up to $\bm{c}$5 seconds (Pu et al., 12 Nov 2025).

Each instance is encoded as a weighted bipartite graph

$\bm{c}$6

where $\bm{c}$7 denotes variable nodes, $\bm{c}$8 denotes constraint nodes, and $\bm{c}$9 contains edges for nonzero entries of $\bm{A}$0 (Pu et al., 12 Nov 2025). Variable-node features include the objective coefficient $\bm{A}$1, lower and upper bounds $\bm{A}$2, an indicator for integrality or binary status, and possibly statistics such as degree. Constraint-node features include the right-hand side $\bm{A}$3, encoded constraint type $\bm{A}$4, and aggregates such as the number of variables. Edge features include the coefficient $\bm{A}$5 and possibly normalized variants or sign indicators. The feature design and preprocessing follow Gasse et al. (2019) and Han et al. (PS, 2023), with the precise feature lists taken from those works (Pu et al., 12 Nov 2025).

3. Objective-level design: Inter-Variable Contrastive Loss

The objective-level contribution of CoCo-MILP is the Inter-Variable Contrastive Loss, or VCL. For an instance $\bm{A}$6, the GNN produces logits $\bm{A}$7 and predictions $\bm{A}$8. For a training solution $\bm{A}$9, the method defines the positive variable set $\bm{b}$0, the negative variable set $\bm{b}$1, and the full binary-variable set $\bm{b}$2 (Pu et al., 12 Nov 2025). The training objective no longer attempts merely to match each $\bm{b}$3 independently; instead, it seeks logits for which positives systematically outrank negatives with margin, both globally and pairwise.

The first component is a global Multi-Sample Contrastive Loss (MSCL), described as InfoNCE-style: $\bm{b}$4 where $\bm{b}$5 is the logit of variable $\bm{b}$6 and $\bm{b}$7 is a temperature parameter (Pu et al., 12 Nov 2025). The numerator is the total mass of positives and the denominator is the total mass of all variables. Minimizing this loss pushes positives collectively to receive higher logits than the rest.

The second component is a local pairwise hinge ranking loss: $\bm{b}$8 with margin $\bm{b}$9 (Pu et al., 12 Nov 2025). Whenever $\bm{l}, \bm{u}$0, the model is penalized; otherwise no pairwise penalty is incurred. This explicitly enforces a fine-grained ordering between variables labeled $\bm{l}, \bm{u}$1 and $\bm{l}, \bm{u}$2.

The combined VCL is

$\bm{l}, \bm{u}$3

where the solution weights $\bm{l}, \bm{u}$4 are the same energy-based weights used in PS, satisfying $\bm{l}, \bm{u}$5 (Pu et al., 12 Nov 2025). The hyperparameter $\bm{l}, \bm{u}$6 controls the weight of the pairwise ranking term.

The paper attributes three key properties to VCL. First, it yields relational gradients: the gradient on a single logit depends on all others through MSCL and on all positive-negative pairs through the ranking term. Second, it is margin-enforcing: positives are not only raised, but explicitly pushed above negatives by a margin. Third, VCL replaces BCE rather than supplementing it; in the main formulation and ablations, no BCE term is retained (Pu et al., 12 Nov 2025). Hyperparameters used in experiments include $\bm{l}, \bm{u}$7, $\bm{l}, \bm{u}$8, and $\bm{l}, \bm{u}$9, with $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$0 on CA, SC, and WA (Pu et al., 12 Nov 2025).

This design reflects a change in surrogate objective. BCE is criticized because it treats variables independently, does not enforce relative ordering, and can produce overlapping logit distributions in which many positives have lower scores than negatives (Pu et al., 12 Nov 2025). CoCo-MILP instead reframes solution prediction as a ranking and contrastive task aligned with the solver’s downstream use of logits for ranking and fixing.

4. Architecture-level design: Intra-Constraint Competitive GNN

CoCo-MILP adopts the GNN encoder from Bachman et al. (2019), also used in PS and Apollo-MILP, and builds on its bipartite half-convolution structure (Pu et al., 12 Nov 2025). Initialization is

$\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$1

followed by alternating updates over constraints and variables. The constraint update is

$\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$2

and the variable update is

$\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$3

for layers $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$4 (Pu et al., 12 Nov 2025). Final variable embeddings use Jumping Knowledge: $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$5 with $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$6 (Pu et al., 12 Nov 2025).

The paper argues that this baseline encoder tends to smooth variable embeddings, especially when variables share many constraints. In MILPs, however, many constraints encode exclusionary relations in which only a few variables should become active. The ICC layer is therefore inserted after each message-passing layer on variables to model competition explicitly (Pu et al., 12 Nov 2025).

For each layer $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$7, let $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$8 denote the variable embedding. ICC applies three steps. First, for each constraint $\bm{x}\in\{0,1\}^p\times\mathbb{R}^{n-p},$9, it computes a constraint-level average of competitor features: $\hat{x}_j \in [0,1]$0 where $\hat{x}_j \in [0,1]$1 is the set of variables in constraint $\hat{x}_j \in [0,1]$2 (Pu et al., 12 Nov 2025). Second, for each variable $\hat{x}_j \in [0,1]$3, it aggregates competitive context from all attached constraints: $\hat{x}_j \in [0,1]$4 where $\hat{x}_j \in [0,1]$5 denotes the set of constraints incident to $\hat{x}_j \in [0,1]$6 (Pu et al., 12 Nov 2025). Third, it performs a competitive deviation update: $\hat{x}_j \in [0,1]$7 where $\hat{x}_j \in [0,1]$8 is a learnable scalar per layer (Pu et al., 12 Nov 2025).

The intended effect is anti-smoothing. If a variable embedding is similar to the average embedding of its competitors, the subtraction reduces its salience; if it deviates from its peers, the updated embedding acquires larger magnitude and a more distinctive direction (Pu et al., 12 Nov 2025). The paper emphasizes that ICC is simple, adds only one scalar $\hat{x}_j \in [0,1]$9 per layer, and does not rely on extra attention weights or multi-head parameters (Pu et al., 12 Nov 2025). Empirically, ICC increases the variance of logits among variables within the same constraint, whereas baseline GNNs exhibit low intra-constraint variance.

A common misconception would be to interpret ICC as a global repulsion mechanism between all variables. The paper does not claim this. Competition is localized to the constraint neighborhoods induced by the bipartite graph, and the update is defined via averages over those local competitive groups (Pu et al., 12 Nov 2025).

5. Training setup, benchmarks, and solver integration

The prediction task is restricted to binary variables. CoCo-MILP outputs a vector $p(x_j=1\mid \mathcal{I})$0 over the binary subset of variables, while continuous variables are left to the solver (Pu et al., 12 Nov 2025). Supervision is derived from multiple feasible solutions $p(x_j=1\mid \mathcal{I})$1 collected by running solvers, with each solution weighted by $p(x_j=1\mid \mathcal{I})$2 (Pu et al., 12 Nov 2025). These solutions serve as supervised signals for VCL.

The evaluation uses four canonical benchmark classes following PS: Set Covering (SC), Combinatorial Auctions (CA), Item Placement (IP), and Workload Appointment (WA) (Pu et al., 12 Nov 2025). The train/validation/test split is $p(x_j=1\mid \mathcal{I})$3 instances per benchmark.

Benchmark	Constraints	Variables
SC	3000	5000 binary vars
CA	2593	1500 binary vars
IP	195	1083 vars (1050 binary + 33 continuous)
WA	64306	61000 vars (1000 binary + 60000 continuous)

In addition to these four benchmarks, the paper evaluates on MIPLIB 2017, including the IIS subset and additional subsets, where both binary and non-binary integer variables appear; training there follows a per-instance-group similarity-based selection (Pu et al., 12 Nov 2025). This broadens the setting beyond purely synthetic or competition-style instances.

The pipeline itself has three stages. First, prediction: the CoCo-MILP GNN runs on the bipartite graph to obtain logits $p(x_j=1\mid \mathcal{I})$4 and marginals $p(x_j=1\mid \mathcal{I})$5. Second, trust-region formulation: hyperparameters $p(x_j=1\mid \mathcal{I})$6 are chosen to fix high-confidence variables, possibly unfix low-confidence ones, and impose the $p(x_j=1\mid \mathcal{I})$7-ball trust region around $p(x_j=1\mid \mathcal{I})$8. Third, search: the reduced MILP is solved by Gurobi or SCIP for up to $p(x_j=1\mid \mathcal{I})$9 seconds (Pu et al., 12 Nov 2025). In this sense, CoCo-MILP modifies the predictor and learning objective while preserving the search-side predict-and-search framework.

6. Empirical performance and ablation evidence

The baselines include solver-only configurations with Gurobi and SCIP, as well as the learning-based methods PS and ConPS. The appendices additionally report results when CoCo-MILP is plugged into Apollo-MILP (Pu et al., 12 Nov 2025). The main comparison uses PS+Gurobi with a $\hat{\bm{x}}$0-second time limit and best-known solutions from $\hat{\bm{x}}$1-second Gurobi runs.

On CA, where the benchmark is maximization and the BKS is $\hat{\bm{x}}$2, Gurobi achieves objective $\hat{\bm{x}}$3 with absolute gap $\hat{\bm{x}}$4, PS+Gurobi achieves $\hat{\bm{x}}$5 with gap $\hat{\bm{x}}$6, ConPS+Gurobi achieves $\hat{\bm{x}}$7 with gap $\hat{\bm{x}}$8, and CoCo-MILP+Gurobi achieves $\hat{\bm{x}}$9 with gap $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$00 (Pu et al., 12 Nov 2025). On SC, with BKS $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$01, the corresponding objectives and gaps are $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$02 for Gurobi, $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$03 for PS+Gurobi, $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$04 for ConPS+Gurobi, and $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$05 for CoCo-MILP+Gurobi (Pu et al., 12 Nov 2025). On IP, with BKS $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$06, Gurobi yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$07, PS+Gurobi yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$08, ConPS+Gurobi yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$09, and CoCo-MILP+Gurobi yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$10. On WA, with BKS $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$11, Gurobi, PS+Gurobi, and ConPS+Gurobi each report $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$12, whereas CoCo-MILP+Gurobi reports $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$13 (Pu et al., 12 Nov 2025).

The paper summarizes these improvements as a primal-gap reduction of up to $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$14 compared to traditional solvers across benchmarks (Pu et al., 12 Nov 2025). It also reports runtime-quality curves showing that CoCo-MILP achieves lower average primal gap at almost all time horizons and reaches high-quality solutions within approximately $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$15 seconds (Pu et al., 12 Nov 2025). This suggests that better ranking of binary variables translates into faster solver convergence, although the exact mechanism remains the standard trust-region search reused from PS.

The MIPLIB IIS subset results further indicate that CoCo-MILP is equal or better than PS and ConPS and at least as good as Gurobi on all five test instances (Pu et al., 12 Nov 2025). For example, on ex1010-pi with BKS $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$16, Gurobi obtains $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$17, PS obtains $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$18, ConPS obtains $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$19, and CoCo-MILP obtains $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$20. On fast0507, CoCo-MILP matches the BKS of $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$21, while PS and ConPS overshoot to $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$22 (Pu et al., 12 Nov 2025).

The method is also not limited to Gurobi. With SCIP as the solver and a $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$23-second limit, CoCo-MILP consistently reduces the gap relative to SCIP and the learning baselines. On CA, for example, SCIP has objective $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$24 and gap $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$25, PS+SCIP has $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$26, ConPS+SCIP has $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$27, and CoCo-MILP+SCIP has $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$28 (Pu et al., 12 Nov 2025).

The ablation study isolates the contributions of VCL and ICC. On SC and CA with Gurobi and a $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$29-second limit, replacing VCL with BCE worsens performance to $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$30 on SC and $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$31 on CA. Removing the ranking term yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$32 and $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$33; removing MSCL yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$34 and $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$35; removing ICC yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$36 and $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$37; and the full model yields $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$38 and $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$39 (Pu et al., 12 Nov 2025). These results support the claim that both VCL components help, and that the ICC layer is crucial for maximal gain, particularly on CA.

Generalization experiments on larger SC and CA instances, with variables and constraints approximately doubled, show that a model trained on smaller instances can still improve solver performance when applied directly to larger ones. On larger CA, with BKS $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$40, CoCo-MILP+Gurobi reaches objective $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$41 and gap $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$42, improving on Gurobi’s $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$43, PS+Gurobi’s $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$44, and ConPS+Gurobi’s $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$45. On larger SC, with BKS $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$46, CoCo-MILP+Gurobi achieves $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$47, improving on Gurobi’s $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$48, PS+Gurobi’s $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$49, and ConPS+Gurobi’s $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$50 (Pu et al., 12 Nov 2025).

The paper also reports modularity. Plugging the CoCo-MILP predictor into Apollo-MILP on SC achieves the BKS exactly, $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$51, and adding an intra-constraint competitive normalization at search time further improves SC to exactly the BKS when combined with CoCo-MILP (Pu et al., 12 Nov 2025).

7. Interpretation, limitations, and broader context

The explanatory argument advanced by CoCo-MILP is that MILP solutions are typically sparse, so the main difficulty is to identify the few variables that should be set to $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$52 (Pu et al., 12 Nov 2025). Solvers use predicted probabilities primarily for ranking and fixing rather than for calibrated probabilistic estimation, so correct ordering matters more than marginal calibration. Constraints such as set-packing, knapsack, and assignment often impose competition, implying that local differentiation among variables within a constraint is more useful than embedding homogenization (Pu et al., 12 Nov 2025).

The paper’s analyses are consistent with this interpretation. Logit distribution visualizations show greater separation between positive and negative variables than PS. For sampled positive-negative pairs, CoCo-MILP yields a distribution of $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$53 that is more positively skewed, indicating better ranking. It also significantly increases the variance of logits within constraints, revealing stronger differentiation among competitors (Pu et al., 12 Nov 2025). A plausible implication is that the method’s benefit derives less from improved probability calibration than from improved score geometry for downstream fixing and trust-region restriction.

Several limitations are explicitly stated. The distribution model remains factorized over binary variables; although VCL introduces relational structure in training, the model does not explicitly represent joint dependencies beyond what the GNN encoder can encode (Pu et al., 12 Nov 2025). The pairwise ranking term has cost $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$54, and while it can be subsampled in practice, the paper does not detail subsampling heuristics. VCL introduces hyperparameters $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$55, which require tuning, and performance also depends on the search-side trust-region parameters $\min_{\bm{x} \in \mathbb{Z}^p \times \mathbb{R}^{n-p} \left\{ \bm{c}^\top \bm{x} \;\middle|\; \bm{A} \bm{x} \le \mathbf{b},\; \bm{l} \le \bm{x} \le \bm{u} \right\},$56, even though the method is described as reasonably robust within ranges (Pu et al., 12 Nov 2025). At the same time, ICC is characterized as lightweight, and the overall overhead is described as small relative to MILP solving time (Pu et al., 12 Nov 2025).

Within the broader landscape of ML for MILP, CoCo-MILP belongs specifically to the solution-prediction branch, rather than to learning branching policies, cut selection, separator learning, or large-neighborhood-search policy learning (Pu et al., 12 Nov 2025). Its two conceptual contributions are loss design tailored to relative ordering of variables and architecture design tailored to competition within constraints. The authors emphasize that these ideas are orthogonal to many existing frameworks and can be integrated into stronger systems such as Apollo-MILP, as shown experimentally (Pu et al., 12 Nov 2025).

Future directions identified in the paper include extending the contrastive and competitive paradigm to more general integer variables via transformations, broader problem families including the full MIPLIB and industrial domains, tighter integration with solver components such as branch heuristics or node scoring, joint training with search-time feedback, and more efficient sampling strategies for pairwise ranking on very large-scale MILPs (Pu et al., 12 Nov 2025). The work also suggests compatibility with instance-generation frameworks such as G2MILP and MILP-StuDio for robust training (Pu et al., 12 Nov 2025). This suggests a research program in which MILP predictors are designed not only around graph structure, but around the competitive combinatorial semantics encoded by constraints and the ranking-oriented demands of downstream search.