arXiv:2606. 00002v1 Announce Type: new Abstract: Mixed-Integer Linear Programming (MILP) decision engines routinely output nominally optimal plans for high-stakes industrial systems.
By Yi-Xiang Hu
arXiv:2608. 09707v1 Announce Type: cross Abstract: Embedding trained neural networks as surrogates within optimisation problems is an established practice in operations research.
By Yu Liu, Jan Kronqvist, Fabricio Oliveira
CG4AI is a column generation framework that trains AI models while enforcing linear constraints on their outputs. It constructs a convex combination of models, using a master linear program to set mixture weights and a pricing subproblem to generate new models guided by dual variables, focusing on the most violated constraints. The method is applied to MNIST digit classification—demonstrating constraint learning, adversarial robustness, error correction, and output relabeling—and to multi‑commodity flow routing, achieving feasible predictors with higher accuracy than single‑model baselines.
By Youcef Magnouche, Abderrahmane Driouch, S\'ebastien Martin, Pierre Bauguion
arXiv:2606. 08797v1 Announce Type: cross Abstract: Decision-focused learning has shown great promise for addressing predict-then-optimize problems, particularly in the presence of under-specified models.
By St\'ephane Eilles-Chan Way, Hugo Percot, Quentin Cappart, Tias Guns, Louis-Martin Rousseau
arXiv:2604. 23053v2 Announce Type: replace Abstract: Mixed Binary Quadratic Programs (MBQPs) are an important and complex set of problems in combinatorial optimization.
By Weimin Huang, Natalie M. Isenberg, J\'an Drgo\v{n}a, Draguna L Vrabie, Bistra Dilkina
The paper introduces PolyFormer, a physics-informed machine learning framework that learns compact polytopic representations of complex constraints. By transforming constraint-induced geometry into efficient polytopic reformulations, PolyFormer reduces optimization complexity and enables the use of standard solvers. Evaluations on large‑scale resource aggregation, network‑constrained optimization, and uncertainty‑aware optimization show up to 6,400‑fold speedups and 99.87% memory savings while keeping feasibility and objective errors low.
By Yilin Wen, Yi Guo, Bo Zhao, Wei Qi, Zechun Hu, Colin Jones, Jian Sun