Combinatorial Optimization and Reasoning with Graph Neural Networks

49Citations
Citations of this article
353Readers
Mendeley users who have this article in their library.

Abstract

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have mostly 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, as a key building block for combinatorial tasks, either directly as solvers or by enhancing the former. This paper presents a conceptual review of recent key advancements in this emerging field, aiming at researchers in both optimization and machine learning.

Cite

CITATION STYLE

APA

Cappart, Q., Chételat, D., Khalil, E. B., Lodi, A., Morris, C., & Velickovic, P. (2021). Combinatorial Optimization and Reasoning with Graph Neural Networks. In IJCAI International Joint Conference on Artificial Intelligence (pp. 4348–4355). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/595

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free