arXiv:2607. 13373v1 Announce Type: cross Abstract: Column generation (CG) is central to many large-scale optimization algorithms, including branch-price-and-cut methods for vehicle routing problems, but unstable dual solutions can substantially slow its convergence.
By Zhengzhong Ricky You, Bo Tang, Haoran Liu, Baichuan Mo
arXiv:2606. 13803v1 Announce Type: new Abstract: Enforcing functional inequality constraints such as monotonicity and convexity in neural networks is a fundamental challenge in many industrial and scientific applications.
By Ruben Wiedemann, Antoine Jacquier, Lukas Gonon
arXiv:2512.20270v2 Announce Type: replace-cross
Abstract: Many engineering tasks require solving families of nonlinear constrained optimization problems, parametrized in setting-specific variables. T...
By Matthias K. Hoffmann, Amine Othmane, Kathrin Fla{\ss}kamp
arXiv:2505.05261v4 Announce Type: replace-cross
Abstract: Two-stage stochastic programming (2SP) offers a basic framework for modelling decision-making under uncertainty, yet scalability remains a ch...
By Yu Liu, Fabricio Oliveira, Jan Kronqvist
arXiv:2605.24437v2 Announce Type: replace
Abstract: We present a novel framework for embedding hard constraint satisfaction into neural network (NN) architectures, specifically feedforward neural net...
By Yang Zhao, Jungeun Lee, Jeong hwan Jeon, Sze Zheng Yong
The article "Constraint Learning by Optimizing over Trained Neural Networks: A Pragmatic Tutorial" discusses the emerging paradigm of embedding trained machine learning models, particularly neural networks, into optimization problems. It explains how constraints can be learned from data or objectives approximated to simplify models, while addressing challenges of size and speed. The tutorial offers practical guidance and demonstrates benefits through a case study that shows smaller, sparser networks can improve efficiency.
By Jiaxiao Fang, Thiago Serra