Semantic Scholar
metadata only
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
The recent work ``Combinatorial Optimization with Physics-Inspired Graph Neural Networks'' [Nat Mach Intell 4 (2022) 367] introduces a physics-inspired unsupervised Graph Neural Network (GNN) to solve combinatorial optimization problems on sparse graphs. To test the performances of these GNNs, the a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Combinatorial optimization with physics-inspired graph neural networks#19723
- Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation#1117641
- Structure-Feature Aligned Graph Learning via Alternating Constrained Optimization#363267
- Physics-Informed Non-Dimensionalisation for Neural Solvers#684012
- MPFlow: Learning Budgeted Max-Flow Optimization on the Lightning Network with Deep Graph Reinforcement Learning#353046
Record · ID 1135853
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive