Fetching the paper…
Reading the bibliography…
We present a learning-based approach to computing solutions for certain NP-hard problems.
Reducibility among combinatorial problems
Richard M. Karp · 1972
Earlier work this paper cites.
Worst-case analysis of a new heuristic for the travelling salesman problem
Nicos Christofides · 1976
Earlier work this paper cites.
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou and Kenneth Steiglitz · 1982
Earlier work this paper cites.
A greedy randomized adaptive search procedure for maximum independent set
Thomas A. Feo, Mauricio G. C. Resende, and Stuart H. Smith · 1994
Earlier work this paper cites.
Approximation algorithms for NP-hard problems
Dorit S Hochbaum · 1997
Earlier work this paper cites.
SATLIB: An online resource for research on SAT
Holger H. Hoos and Thomas Stützle · 2000
Earlier work this paper cites.
Reactive local search for the maximum clique problem
Roberto Battiti and Marco Protasi · 2001
Earlier work this paper cites.
Approximation Algorithms
Vijay V. Vazirani · 2004
Earlier work this paper cites.
Handbook of Approximation Algorithms and Metaheuristics
Teofilo F. Gonzalez · 2007
Earlier work this paper cites.
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Ke Xu, Frédéric Boussemart, Fred Hemery, and Christophe Lecoutre · 2007
Earlier work this paper cites.
Algorithms
Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani · 2008
Earlier work this paper cites.
Z3: An efficient SMT solver
Leonardo Mendonça de Moura and Nikolaj Bjørner · 2008
Earlier work this paper cites.
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Andrea Grosso, Marco Locatelli, and Wayne J. Pullan · 2008
Earlier work this paper cites.
Collective classification in network data
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Gallagher, and Tina Eliassi-Rad · 2008
Earlier work this paper cites.
The Algorithm Design Manual
Steven Skiena · 2008
Cited alongside, same era.
Computational Complexity: A Modern Approach
Sanjeev Arora and Boaz Barak · 2009
Cited alongside, same era.
Rectified linear units improve restricted Boltzmann machines
Vinod Nair and Geoffrey E. Hinton · 2010
Cited alongside, same era.
The Design of Approximation Algorithms
David P Williamson and David B Shmoys · 2011
Cited alongside, same era.
Fast local search for the maximum independent set problem
Diogo Vieira Andrade, Mauricio G. C. Resende, and Renato Fonseca F. Werneck · 2012
Cited alongside, same era.
Multiple choice learning: Learning to produce multiple structured outputs
Abner Guzmán-Rivera, Dhruv Batra, and Pushmeet Kohli · 2012
Cited alongside, same era.
SAT competition 2017
Tomáš Balyo, Marijn JH Heule, and Matti Järvisalo · 2017
Later among the works it cites.
Geometric deep learning: Going beyond Euclidean data
Michael M. Bronstein, Joan Bruna, Yann LeCun, Arthur Szlam, and Pierre Vandergheynst · 2017
Later among the works it cites.
Photographic image synthesis with cascaded refinement networks
Qifeng Chen and Vladlen Koltun · 2017
Later among the works it cites.
Learning combinatorial optimization algorithms over graphs
Hanjun Dai, Elias B. Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song · 2017
Later among the works it cites.
Neural message passing for quantum chemistry
Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl · 2017
Later among the works it cites.
Semi-supervised classification with graph convolutional networks
Thomas N. Kipf and Max Welling · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Learning to search in branch and bound algorithms
He He, Hal Daumé III, and Jason Eisner · 2014
Cited alongside, same era.
SNAP Datasets: Stanford large network dataset collection
Jure Leskovec and Andrej Krevl · 2014
Cited alongside, same era.
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
Takuya Akiba and Yoichi Iwata · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2015
Cited alongside, same era.
Pointer networks
Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly · 2015
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.
A note on learning algorithms for quadratic assignment with graph neural networks
Alex Nowak, Soledad Villar, Afonso S. Bandeira, and Joan Bruna · 2017
Later among the works it cites.
Mastering the game of Go without human knowledge
David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, et al · 2017
Later among the works it cites.
Gurobi optimizer reference manual, version 8.0, 2018
Gurobi Optimization Inc · 2018
Closest in time.
Attention solves your TSP, approximately
Wouter Kool, Herke van Hoof, and Max Welling · 2018
Closest in time.
Interactive image segmentation with latent diversity
Zhuwen Li, Qifeng Chen, and Vladlen Koltun · 2018
Closest in time.
Learning a SAT solver from single-bit supervision
Daniel Selsam, Matthew Lamm, Benedikt Bünz, Percy Liang, Leonardo de Moura, and David L. Dill · 2018
Closest in time.