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. 2406.11897
  4. Cited By
A Benchmark for Maximum Cut: Towards Standardization of the Evaluation
  of Learned Heuristics for Combinatorial Optimization

A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization

14 June 2024
Ankur Nath
Alan Kuhnle
    CML
ArXivPDFHTML

Papers citing "A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization"

3 / 3 papers shown
Title
How Good Is Neural Combinatorial Optimization? A Systematic Evaluation
  on the Traveling Salesman Problem
How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
Shengcai Liu
Yu Zhang
K. Tang
Xin Yao
62
39
0
22 Sep 2022
What's Wrong with Deep Learning in Tree Search for Combinatorial
  Optimization
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization
Maximilian Böther
Otto Kißig
M. Taraz
S. Cohen
Karen Seidel
Tobias Friedrich
AI4CE
73
46
0
25 Jan 2022
Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph
  Neural Networks
Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks
Minjie Wang
Da Zheng
Zihao Ye
Quan Gan
Mufei Li
...
J. Zhao
Haotong Zhang
Alex Smola
Jinyang Li
Zheng-Wei Zhang
AI4CE
GNN
206
746
0
03 Sep 2019
1