Unsupervised learning with GNNs for QUBO-based combinatorial optimization

DOI10.1016/J.EJCO.2025.100116MaRDI QIDQ6880263zbMATH OpenFDO

Authors Olga Krylova, Frank Phillipson

Publication date 19 December 2025

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCO.2025.100116

zbMATH Keywords

GNNsmaximum cutmaximum independent setQUBOunsupervised learning

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A unified framework for modeling and solving combinatorial optimization problems: a tutorial
• Algorithms for implicit hitting set problems
• Approximating maximum independent sets by excluding subgraphs
• Barriers for the performance of graph neural networks (GNN) in discrete random structures
• Greed is good: approximating independent sets in sparse and bounded-degree graphs
• Neural networks and deep learning. A textbook
• Quadratic reformulations of nonlinear binary optimization problems
• Understanding the message passing in graph neural networks via power iteration clustering

This page was built for publication: Unsupervised learning with GNNs for QUBO-based combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880263)