Combinatorial Optimization with Physics-Inspired Graph Neural Networks

by   Martin J. A. Schuetz, et al.

We demonstrate how graph neural networks can be used to solve combinatorial optimization problems. Our approach is broadly applicable to canonical NP-hard problems in the form of quadratic unconstrained binary optimization problems, such as maximum cut, minimum vertex cover, maximum independent set, as well as Ising spin glasses and higher-order generalizations thereof in the form of polynomial unconstrained binary optimization problems. We apply a relaxation strategy to the problem Hamiltonian to generate a differentiable loss function with which we train the graph neural network and apply a simple projection to integer variables once the unsupervised training process has completed. We showcase our approach with numerical results for the canonical maximum cut and maximum independent set problems. We find that the graph neural network optimizer performs on par or outperforms existing solvers, with the ability to scale beyond the state of the art to problems with millions of variables.


page 1

page 2

page 3

page 4


Cracking nuts with a sledgehammer: when modern graph neural networks do worse than classical greedy algorithms

The recent work “Combinatorial Optimization with Physics-Inspired Graph ...

Graph Coloring with Physics-Inspired Graph Neural Networks

We show how graph neural networks can be used to solve the canonical gra...

DOGE-Train: Discrete Optimization on GPU with End-to-end Training

We present a fast, scalable, data-driven approach for solving linear rel...

Combinatorial Auctions and Graph Neural Networks for Local Energy Flexibility Markets

This paper proposes a new combinatorial auction framework for local ener...

A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks

Many inverse problems are formulated as optimization problems over certa...

Please sign up or login with your details

Forgot password? Click here to reset