dorsal/arxiv
View SchemaCombinatorial Optimization Augmented Machine Learning
| Authors | Maximilian Schiffer, Heiko Hoppe, Yue Su, Louis Bouvier, Axel Parmentier |
|---|---|
| Categories | |
| ArXiv ID | 2601.10583vv1 |
| URL | https://arxiv.org/abs/2601.10583 |
| License | http://creativecommons.org/licenses/by/4.0/ |
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.
{
"annotation_id": "3ddca5b6-ab7f-4ea4-82fc-f1680c337014",
"date_created": "2026-02-17T05:53:23.735000Z",
"date_modified": "2026-02-17T05:53:23.735000Z",
"file_hash": "027ae3fac8631aa047489cdb0786627bfbaa1e53457f1dfed89c2ac18e68e96c",
"private": false,
"record": {
"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.",
"arxiv_id": "2601.10583",
"authors": [
"Maximilian Schiffer",
"Heiko Hoppe",
"Yue Su",
"Louis Bouvier",
"Axel Parmentier"
],
"categories": [
"cs.LG",
"math.OC"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Combinatorial Optimization Augmented Machine Learning",
"url": "https://arxiv.org/abs/2601.10583",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "046024b1-1206-4279-ae5e-305f5f08dfbb",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}