Two-Stage Mixed-Integer Quadratic Programming in Polynomial Time
math.OC, cs.CC, cs.DS
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Curvature batching gives single-exponential integer quadratic programming
- Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming
- An Algorithmic Theory of Integer Programming
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