ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2210.00623
  4. Cited By
Inability of a graph neural network heuristic to outperform greedy
  algorithms in solving combinatorial optimization problems like Max-Cut

Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut

2 October 2022
S. Boettcher
    GNN
ArXivPDFHTML

Papers citing "Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut"

3 / 3 papers shown
Title
Decision-focused Graph Neural Networks for Combinatorial Optimization
Decision-focused Graph Neural Networks for Combinatorial Optimization
Yang Liu
Chuan Zhou
Peng Zhang
Shirui Pan
Zhao Li
Hongyang Chen
GNN
AI4CE
41
1
0
05 Jun 2024
A Short Review on Novel Approaches for Maximum Clique Problem: from
  Classical algorithms to Graph Neural Networks and Quantum algorithms
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino
L. Buffoni
Bogdan Zavalnij
GNN
40
5
0
13 Mar 2024
Reply to: Inability of a graph neural network heuristic to outperform
  greedy algorithms in solving combinatorial optimization problems
Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
M. Schuetz
J. K. Brubaker
H. Katzgraber
33
2
0
03 Feb 2023
1