Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon

2018-11-15 · Yoshua Bengio, Andrea Lodi, Antoine Prouvost

This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems, state-of-the-art algorithms rely on handcrafted heuristics for making decisions that are otherwise too expensive to compute or mathematically not well defined. Thus, machine learning looks like a natural candidate to make such decisions in a more principled and optimized way. We advocate for pushing further the integration of machine learning and combinatorial optimization and detail a methodology to do so. A main point of the paper is seeing generic optimization problems as data points and inquiring what is the relevant distribution of problems to use for learning on a given task.

📄 PDF Abstract BibTeX arXiv:1811.06128

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningCombinatorial Optimization

Combinatorial Optimization Augmented Machine Learning

2026-01-15 · Maximilian Schiffer, Heiko Hoppe, Yue Su, Louis Bouvier 외 arxiv

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 orac…

Stochastic Optimization Reinforcement Learning

Modelling tourism demand to Spain with machine learning techniques. The impact of forecast horizon on model selection

2018-05-02 · Oscar Claveria, Enric Monte, Salvador Torra

This study assesses the influence of the forecast horizon on the forecasting performance of several machine learning techniques. We compare the fo recast accuracy of Support Vector Regression (SVR) to Neural Network (NN)…

BIG-bench Machine Learning Model Selection regression

Edge-wise Topological Divergence Gaps: Guiding Search in Combinatorial Optimization

2025-12-16 · Ilya Trofimov, Daria Voronkova, Alexander Mironenko, Anton Dmitriev 외 arxiv

We introduce a topological feedback mechanism for the Travelling Salesman Problem (TSP) by analyzing the divergence between a tour and the minimum spanning tree (MST). Our key contribution is a canonical decomposition th…

Neural Combinatorial Optimization with Reinforcement Learning

2016-11-29 · Irwan Bello, Hieu Pham, Quoc V. Le, Mohammad Norouzi 외

This paper presents a framework to tackle combinatorial optimization problems using neural networks and reinforcement learning. We focus on the traveling salesman problem (TSP) and train a recurrent network that, given a…

Combinatorial Optimization reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+1

Exploration-Exploitation-Evaluation (EEE): A Framework for Metaheuristic Algorithms in Combinatorial Optimization

2025-10-06 · Ethan Davis arxiv

We introduce a framework for applying metaheuristic algorithms, such as ant colony optimization (ACO), to combinatorial optimization problems (COPs) like the traveling salesman problem (TSP). The framework consists of th…