Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems

被引：0

作者：

Schuetz, Martin J. A. ^{[1
,2
]}

Brubaker, J. Kyle ^{[1
]}

Katzgraber, Helmut G. ^{[1
,2
]}

机构：

[1] Amazon Quantum Solut Lab, Seattle, WA 98109 USA

[2] AWS Ctr Quantum Comp, Pasadena, CA 91105 USA

来源：

NATURE MACHINE INTELLIGENCE | 2023年 / 5卷 / 01期

关键词：

Compendex;

D O I：

10.1038/s42256-022-00588-z

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：26 / 28

页数：3

共 50 条

[1] Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
Martin J. A. Schuetz
J. Kyle Brubaker
Helmut G. Katzgraber
[J]. Nature Machine Intelligence, 2023, 5 : 26 - 28
[2] Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
Stefan Boettcher
[J]. Nature Machine Intelligence, 2023, 5 : 24 - 25
[3] Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
Boettcher, Stefan
[J]. NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 24 - 25
[4] Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Martin J. A. Schuetz
J. Kyle Brubaker
Helmut G. Katzgraber
[J]. Nature Machine Intelligence, 2023, 5 : 32 - 34
[5] Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Schuetz, Martin J. A.
Brubaker, J. Kyle
Katzgraber, Helmut G.
[J]. NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 32 - 34
[6] Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Angelini, Maria Chiara
Ricci-Tersenghi, Federico
[J]. NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 29 - 31
[7] Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Maria Chiara Angelini
Federico Ricci-Tersenghi
[J]. Nature Machine Intelligence, 2023, 5 : 29 - 31
[8] Solving combinatorial optimization problems using the oscillatory neural network
Watanabe, Y
Yoshino, K
Kakeshita, T
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (01) : 72 - 77
[9] Solving Combinatorial Optimization Problems with Deep Neural Network: A Survey
Wang, Feng
He, Qi
Li, Shicheng
[J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2024, 29 (05) : 1266 - 1282
[10] A BRIEF INTRODUCTION TO EXACT, APPROXIMATION, AND HEURISTIC ALGORITHMS FOR SOLVING HARD COMBINATORIAL OPTIMIZATION PROBLEMS
Festa, P.
[J]. 2014 16TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2014,

← 1 2 3 4 5 →