Searcharxiv⌕ Search

arXiv subjects

Brenda Dietrich

Publications and source records attributed to Brenda Dietrich.

4 recordsLinked to original sources

To Race or Not to Race? Exploiting Performance Variability in Mixed-Integer Programming via Root-Gated Resource Allocation

Mixed-integer programming (MIP) solver runtimes vary substantially across random seeds. Parallel replication exploits this variability but can waste computational resources when applied indiscriminately. We investigate whether information from an ordinary solve can guide this allocation decision. We formulate replication under a finite deadline, establish an exact relationship between runtime dispersion and the value of independent searches, and analyze delayed replication and imperfect allocation decisions. Using 101,615 seeded SCIP runs, we examine the association between root-LP dual degeneracy and replication value. We then introduce a non-invasive root-gated policy that preserves the original solver trajectory and launches three additional seeded processes when a root dual-degeneracy indicator reaches a fixed threshold. In a prospective two-hour experiment on 130 paired instances, root-gated racing proves optimality on 77 instances (59.23%), versus 73 (56.15%) for both Single and unconditional Race-4, while reducing active worker-process occupancy by 43.00% relative to unconditional racing. These findings demonstrate the promise of selective parallel resource allocation without solver-source modifications.

math.OC↗

Mitigating Performance Variability in Mixed-Integer Programming Solvers via LP State Steering

Modern mixed-integer programming (MIP) solvers repeatedly solve linear programming (LP) relaxations, but the LP state transferred from the simplex algorithm to the branch-and-bound tree is typically treated as an artifact of perturbation, presolve history, and numerical trajectory. This is harmless in pure linear programming, where alternative optimal bases certify the same bound. In MIP, however, those bases can expose distinct fractional structures, active rows, reduced costs, branching candidates, and reoptimization states. The inherited LP state is therefore an initial condition for the integer search. We exploit this initial condition to mitigate computational performance variability. The proposed framework generates alternative LP states on or near degenerate optimal faces, evaluates them within an auxiliary solver environment, and either selects a single state or executes a portfolio of candidate states in parallel. A handcrafted synthetic instance isolates the relationship between the initial LP state, the fractional profile, the branching trajectory, and the resulting node-count distribution: root-state steering reduces the weighted variability score~(WVS) by 67% over 1,000 paired seeds and produces no node-count regressions relative to default SCIP. On a separate 130-instance MIPLIB 2017 validation set with up to 50 paired seeds per instance, the top-five policy improves solve completion from 3,792 to 3,894 runs, reduces the shifted geometric mean of the recorded node count from 2,574.7 to 1,198.0, and lowers the median WVS by 9% on instances reliably solved by the baseline. These results demonstrate that the branch-and-bound phase inherits a specific LP state rather than merely an LP bound, and that the active management of this state systematically mitigates computational performance variability.

math.OC↗

When Solvers Get Moody: Quantifying and Predicting Performance Variability in Mixed Integer Programming

Mixed-integer programming (MIP) solvers are widely used, yet their performance can vary substantially even under seemingly neutral perturbations. Such variability complicates benchmarking, and the interpretation of computational studies. We introduce the Weighted Variability Score (WVS), a robust multi-component metric that aggregates dispersion in normalized runtime, final optimality gap, LP iterations, and branch-and-bound nodes across repeated runs. On a large subset of MIPLIB 2017 instances, each solved in 100 randomized runs under a four-hour limit, WVS reveals a right-skewed distribution with a substantial upper tail: many instances are essentially stable, but some exhibit large variability that is not explained by basic properties alone. Notably, this experiment proved optimality for the open instance 'neos-5045105-creuse' in two SCIP runs. Using static descriptors and root-level features, a tree-based predictor with a gated tail uplift achieves a mean absolute error of 0.058 and Spearman rank correlation of 0.65 on a sealed test split. Feature-importance analysis highlights root degeneracy, matrix structure, coefficient ranges, and presolve reductions as the main drivers of high WVS. Because variability is systematic and partially predictable from inexpensive early-run features, our findings offer a practical tool for preemptive tuning and lay a foundation for fairer evaluation of new algorithms.

math.OC↗

Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time

Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure. In this work, we develop a new framework to solve any combinatorial optimization problem over graphs that can be formulated as a single player game defined by states, actions, and rewards, including minimum spanning tree, shortest paths, traveling salesman problem, and vehicle routing problem, without expert knowledge. Our method trains a graph neural network using reinforcement learning on an unlabeled training set of graphs. The trained network then outputs approximate solutions to new graph instances in linear running time. In contrast, previous approximation algorithms or heuristics tailored to NP-hard problems on graphs generally have at least quadratic running time. We demonstrate the applicability of our approach on both polynomial and NP-hard problems with optimality gaps close to 1, and show that our method is able to generalize well: (i) from training on small graphs to testing on large graphs; (ii) from training on random graphs of one type to testing on random graphs of another type; and (iii) from training on random graphs to running on real world graphs.

cs.LG↗