Mixed-Integer Program Sensitivity Analysis via Branch-and-Bound Trees
math.OC
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data
- Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
- Efficient LP warmstarting for linear modifications of the constraint matrix
- Analyzing changes in optimal variables in linear programming with uncertain parameters
- Large Language Models for Supply Chain Optimization
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise