Fetching the paper…
Reading the bibliography…
End-to-end (geometric) deep learning has seen first successes in approximating the solution of combinatorial optimization problems.
Guiding High-Performance SAT Solvers with Unsat-Core Predictions
Daniel Selsam and Nikolaj Bjørner · 1903
Earlier work this paper cites.
An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
Chaitanya K. Joshi, Thomas Laurent, and Xavier Bresson · 1906
Earlier work this paper cites.
Efficient special case algorithms for the n-line planar traveling salesman problem
M. Cutler · 1980
Earlier work this paper cites.
The N-line Traveling Salesman Problem, 1991
Günter Rote · 1991
Earlier work this paper cites.
Learning and example selection for object and pattern detection
Kah Kay Sung · 1995
Earlier work this paper cites.
SATLIB: An online resource for research on SAT
Holger Hoos and Thomas Stützle · 2000
Earlier work this paper cites.
Minisat v1.13-a sat solver with conflict-clause minimization
Niklas Sörensson and Niklas Een · 2005
Earlier work this paper cites.
Concorde tsp solver, 2006
David Applegate, Ribert Bixby, Vasek Chvatal, and William Cook · 2006
Earlier work this paper cites.
Learning TSP Requires Rethinking Generalization
Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent · 2006
Earlier work this paper cites.
Predicting learnt clauses quality in modern sat solvers
Gilles Audemard and Laurent Simon · 2009
Earlier work this paper cites.
Restart Strategy Selection Using Machine Learning Techniques
Shai Haim and Toby Walsh · 2009
Earlier work this paper cites.
A Simple Fine-tuning Is All You Need: Towards Robust Deep Learning Via Adversarial Fine-tuning
Ahmadreza Jeddi, Mohammad Javad Shafiee, and Alexander Wong · 2012
Earlier work this paper cites.
Intriguing properties of neural networks
Christian Szegedy, W. Zaremba, Ilya Sutskever, Joan Bruna, D. Erhan, Ian J. Goodfellow, and R. Fergus · 2014
Earlier work this paper cites.
Adam: A Method for Stochastic Optimization
Diederik P. Kingma and Jimmy Ba · 2015
Earlier work this paper cites.
Neural combinatorial optimization with reinforcement learning
Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio · 2016
Earlier work this paper cites.
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 Khalil, Hanjun Dai, Yuyu Zhang, Bistra Dilkina, and Le Song · 2017
Cited alongside, same era.
Adversarial attack on graph structured data
Hanjun Dai, Hui Li, Tian Tian, Huang Xin, Lin Wang, Zhu Jun, and Song Le · 2018
Cited alongside, same era.
Learning heuristics for the tsp by policy gradient
Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak, and Louis-Martin Rousseau · 2018
Cited alongside, same era.
PySAT: A Python toolkit for prototyping with SAT oracles
Alexey Ignatiev, Antonio Morgado, and Joao Marques-Silva · 2018
Cited alongside, same era.
Combinatorial optimization with graph convolutional networks and guided tree search
Zhuwen Li, Qifeng Chen, and Vladlen Koltun · 2018
Topology attack and defense for graph neural networks: An optimization perspective
Kaidi Xu, Hongge Chen, Sijia Liu, Pin Yu Chen, Tsui Wei Weng, Mingyi Hong, and Xue Lin · 2019
Later among the works it cites.
Learning local search heuristics for boolean satisfiability
Emre Yolcu and Barnabás Póczos · 2019
Later among the works it cites.
Adversarial attacks on neural networks for graph data
Daniel Zügner, Amir Akbarnejad, and Stephan Günnemann · 2019
Later among the works it cites.
Predicting propositional satisfiability via end-to-end learning
Chris Cameron, Rex Chen, Jason Hartford, and Kevin Leyton-Brown · 2020
Later among the works it cites.
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
N. Vesselinova, R. Steinert, D. F. Perez-Ramirez, and M. Boman · 2020
Later among the works it cites.
Adversarial Attacks and Defenses in Images, Graphs and Text: A Review
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning to solve circuit-sat: An unsupervised differentiable approach
Saeed Amizadeh, Sergiy Matusevych, and Markus Weimer · 2019
Cited alongside, same era.
Antoine François, Quentin Cappart, and Louis-Martin Rousseau · 2019
Cited alongside, same era.
Attention, Learn to Solve Routing Problems!
Wouter Kool, Herke van Hoof, and Max Welling · 2019
Cited alongside, same era.
Improving SAT solver heuristics with graph networks and reinforcement learning
Vitaly Kurin, Saad Godil, Shimon Whiteson, and Bryan Catanzaro · 2019
Cited alongside, same era.
Learning to solve np-complete problems: A graph neural network for decision TSP
Marcelo O. R. Prates, Pedro H. C. Avelar, Henrique Lemos, Luís C. Lamb, and Moshe Y. Vardi · 2019
Cited alongside, same era.
Learning a SAT solver from single-bit supervision
Daniel Selsam, Matthew Lamm, Benedikt Bünz, Percy Liang, Leonardo de Moura, and David L. Dill · 2019
Cited alongside, same era.
Han Xu, Yao Ma, Hao-Chen Liu, Debayan Deb, Hui Liu, Ji-Liang Tang, and Anil K. Jain · 2020
Later among the works it cites.
It’s Not What Machines Can Learn, It’s What We Cannot Teach
Gal Yehuda, Moshe Gabel, and Assaf Schuster · 2020
Later among the works it cites.
Machine learning for combinatorial optimization: A methodological tour d’horizon
Yoshua Bengio, Andrea Lodi, and Antoine Prouvost · 2021
Closest in time.
The transformer network for the traveling salesman problem
Xavier Bresson and Thomas Laurent · 2021
Closest in time.
Combinatorial optimization and reasoning with graph neural networks
Quentin Cappart, Didier Chételat, Elias Khalil, Andrea Lodi, Christopher Morris, and Petar Veličković · 2021
Closest in time.
Robustness of graph neural networks at scale
Simon Geisler, Tobias Schmidt, Hakan Şirin, Daniel Zügner, Aleksandar Bojchevski, and Stephan Günnemann · 2021
Closest in time.
Graph neural networks: Adversarial robustness
Stephan Günnemann · 2021
Closest in time.
A bi-level framework for learning to solve combinatorial optimization on graphs
Runzhong Wang, Zhigang Hua, Gan Liu, Jiayi Zhang, Junchi Yan, Feng Qi, Shuang Yang, Jun Zhou, and Xiaokang Yang · 2021
Closest in time.
Derivative-free optimization adversarial attacks for graph convolutional networks
Runze Yang and Teng Long · 2021
Closest in time.
A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems
P. Festa · 2064
Closest in time.