Log In Sign Up

Combinatorial optimization and reasoning with graph neural networks

by   Quentin Cappart, et al.

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring the fact that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning, especially graph neural networks (GNNs), as a key building block for combinatorial tasks, either directly as solvers or by enhancing exact solvers. The inductive bias of GNNs effectively encodes combinatorial and relational input due to their invariance to permutations and awareness of input sparsity. This paper presents a conceptual review of recent key advancements in this emerging field, aiming at researchers in both optimization and machine learning.


page 1

page 2

page 3

page 4


The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights

Combinatorial optimization is a well-established area in operations rese...

Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective

Neural-symbolic computing has now become the subject of interest of both...

Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers

We present Ecole, a new library to simplify machine learning research fo...

Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?

Extensive research has been conducted, over recent years, on various way...

ML4CO-KIDA: Knowledge Inheritance in Data Aggregation

The Machine Learning for Combinatorial Optimization (ML4CO) NeurIPS 2021...

Learning TSP Requires Rethinking Generalization

End-to-end training of neural network solvers for combinatorial problems...

Code Repositories


Project for the QHack Open Hackathon by team 'QUACKQUACKQUACK'

view repo