Machine Learning Algorithms for Improving Exact Classical Solvers in Mixed Integer Continuous Optimization

2025-08-09

AI Summary

This work addresses integer and mixed-integer nonlinear programming (INLP/MINLP) problems, aiming to accelerate exact algorithms—particularly branch-and-bound (BB)—while rigorously preserving global optimality. We propose a unified learnable BB framework that jointly integrates supervised learning, imitation learning, and reinforcement learning into four core components: branching variable selection, cutting-plane generation, node prioritization, and parameter tuning. The framework is agnostic to variable types—supporting discrete, continuous, and hybrid structures—and is validated on real-world applications including unit commitment, vehicle routing, and hydroelectric scheduling. Key contributions include: (i) the first taxonomy of learning-augmented optimization methods organized along both solver architecture and learning paradigm dimensions; (ii) substantial convergence acceleration without compromising solution quality or optimality guarantees; and (iii) advancement toward scalable, generalizable intelligent optimization solvers.

Technology Category

• Search and Optimization: Learning to Search
• Intelligent Robots: Learning & Optimization for ROB
• Constraint Satisfaction and Optimization: Constraint Learning and Acquisition

Application Category

• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• Semantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMs
• Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphs

Abstract

Integer and mixed-integer nonlinear programming (INLP, MINLP) are central to logistics, energy, and scheduling, but remain computationally challenging. This survey examines how machine learning and reinforcement learning can enhance exact optimization methods - particularly branch-and-bound (BB), without compromising global optimality. We cover discrete, continuous, and mixed-integer formulations, and highlight applications such as crew scheduling, vehicle routing, and hydropower planning. We introduce a unified BB framework that embeds learning-based strategies into branching, cut selection, node ordering, and parameter control. Classical algorithms are augmented using supervised, imitation, and reinforcement learning models to accelerate convergence while maintaining correctness. We conclude with a taxonomy of learning methods by solver class and learning paradigm, and outline open challenges in generalization, hybridization, and scaling intelligent solvers.

Problem

• Enhancing exact optimization methods with machine learning
• Improving branch-and-bound efficiency without losing optimality
• Applying learning to discrete, continuous, mixed-integer problems

Innovation

• Machine learning enhances branch-and-bound methods
• Learning-based strategies in branching and cut selection
• Supervised and reinforcement learning maintain solution correctness