Fetching the paper…
Reading the bibliography…
There have been increasing challenges to solve combinatorial optimization problems by machine learning.
On random graphs
Paul Erdos · 1959
Earlier work this paper cites.
Dynamic Programming and Markov Processes
Richard Bellman and Ronald Albert Howard · 1960
Earlier work this paper cites.
The complexity of theorem-proving procedures
Stephen A. Cook · 1971
Earlier work this paper cites.
“neural” computation of decisions in optimization problems
John J. Hopfield and David W. Tank · 1985
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Collective dynamics of ‘small-world’ networks
Duncan J. Watts and Steven H. Strogatz · 1998
Earlier work this paper cites.
A 2-approximation algorithm for the undirected feedback vertex set problem
Vineet Bafna, Piotr Berman, and Toshihiro Fujito · 1999
Earlier work this paper cites.
Emergence of scaling in random networks
Barabási and Albert · 1999
Earlier work this paper cites.
Rank-two relaxation heuristics for max-cut and other binary quadratic programs
Samuel Burer, Renato Monteiro, and Yin Zhang · 2001
Earlier work this paper cites.
On the unique games conjecture
Subhash Khot and Nisheeth K Vishnoi · 2005
Earlier work this paper cites.
Bandit based monte-carlo planning
Levente Kocsis and Cs. Szepesvari · 2006
Earlier work this paper cites.
Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series)
Teofilo F. Gonzalez · 2007
Earlier work this paper cites.
Hybridizing the cross-entropy method: An application to the max-cut problem
Manuel Laguna, Abraham Duarte, and Rafael Marti · 2007
Cited alongside, same era.
Parameterized algorithms
Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh · 2015
Cited alongside, same era.
The network data repository with interactive graph analytics and visualization
Ryan A. Rossi and Nesreen Ahmed · 2015
Cited alongside, same era.
Branch-and-reduce exponential/fpt algorithms in practice: A case study of vertex cover
Takuya Akiba and Yoichi Iwata · 2016
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Irwan Bello, Hieu Pham, Quoc V. Le, Mohammad Norouzi, and Samy Bengio · 2016
Cited alongside, same era.
Finding near-optimal independent sets at scale
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F Werneck · 2017
Later among the works it cites.
Attention, learn to solve routing problems!
Wouter Kool, Herke van Hoof, and Max Welling · 2018
Later among the works it cites.
Combinatorial optimization with graph convolutional networks and guided tree search
Zhuwen Li, Qifeng Chen, and Vladlen Koltun · 2018
Later among the works it cites.
Invariant and equivariant graph networks
Haggai Maron, Heli Ben-Hamu, Nadav Shamir, and Yaron Lipman · 2018
Later among the works it cites.
Weisfeiler and leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hanjun Dai, Bo Dai, and Le Song · 2016
Cited alongside, same era.
Mastering the game of go with deep neural networks and tree search
David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al · 2016
Cited alongside, same era.
What works best when? a systematic evaluation of heuristics for max-cut and qubo
Iain Dunning, Swati Gupta, and John Silberholz · 2017
Cited alongside, same era.
Neural message passing for quantum chemistry
Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl · 2017
Cited alongside, same era.
Learning combinatorial optimization algorithms over graphs
Elias Boutros Khalil, Hanjun Dai, Yuyu Zhang, Bistra N. Dilkina, and Le Song · 2017
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Thomas N. Kipf and Max Welling · 2017
Cited alongside, same era.
Provably powerful graph networks
Haggai Maron, Heli Ben-Hamu, Hadar Serviansky, and Yaron Lipman
Cited in the paper.
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2018
Later among the works it cites.
Gurobi optimizer reference manual, 2019
LLC Gurobi Optimization · 2019
Closest in time.
Universal invariant and equivariant graph neural networks
Nicolas Keriven and Gabriel Peyré · 2019
Closest in time.
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
Closest in time.
Elf opengo: An analysis and open reimplementation of alphazero
Yuandong Tian, Jerry Ma, Qucheng Gong, Shubho Sengupta, Zhuoyuan Chen, James Pinkerton, and C. Lawrence Zitnick · 2019
Closest in time.
Satnet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver
Po-Wei Wang, Priya L. Donti, Bryan Wilder, and J. Zico Kolter · 2019
Closest in time.