Combinatorial Optimization Augmented Machine Learning

2026-01-15

AI Summary

This work addresses the central challenge of integrating predictive models with combinatorial optimization to enable data-driven intelligent decision-making while preserving solution feasibility. It proposes a unified framework that embeds combinatorial optimization solvers directly into machine learning pipelines, systematically combining empirical risk minimization, imitation learning, and reinforcement learning. A key component of the framework is a feasibility-preserving mechanism designed to operate effectively in both static and dynamic settings. Beyond algorithmic integration, the study establishes a comprehensive problem taxonomy and algorithmic paradigm for this research direction, and provides a systematic review of theoretical foundations and applications in domains such as scheduling and routing, thereby offering a clear roadmap for future research.

Technology Category

• Search and Optimization: Combinatorial Optimization
• Constraint Satisfaction and Optimization: Mixed Discrete/Continuous Optimization
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Semantics and Knowledge: Data modeling to support human-machine intelligence, including LLMs agents, intelligent system behavior, explanations, and user-friendly interactions
• User Modeling, Personalization and Recommendation: Federated recommendation systems and personalization
• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs

Abstract

Combinatorial optimization augmented machine learning (COAML) has recently emerged as a powerful paradigm for integrating predictive models with combinatorial decision-making. By embedding combinatorial optimization oracles into learning pipelines, COAML enables the construction of policies that are both data-driven and feasibility-preserving, bridging the traditions of machine learning, operations research, and stochastic optimization. This paper provides a comprehensive overview of the state of the art in COAML. We introduce a unifying framework for COAML pipelines, describe their methodological building blocks, and formalize their connection to empirical cost minimization. We then develop a taxonomy of problem settings based on the form of uncertainty and decision structure. Using this taxonomy, we review algorithmic approaches for static and dynamic problems, survey applications across domains such as scheduling, vehicle routing, stochastic programming, and reinforcement learning, and synthesize methodological contributions in terms of empirical cost minimization, imitation learning, and reinforcement learning. Finally, we identify key research frontiers. This survey aims to serve both as a tutorial introduction to the field and as a roadmap for future research at the interface of combinatorial optimization and machine learning.

Problem

• Combinatorial Optimization
• Machine Learning
• Decision-Making
• Feasibility-Preserving
• Predictive Modeling

Innovation

• Combinatorial Optimization
• Machine Learning
• Empirical Cost Minimization
• Imitation Learning
• Reinforcement Learning