Fetching the paper…
Reading the bibliography…
In this paper, we introduce a two-player zero-sum framework between a trainable \emph{Solver} and a \emph{Data Generator} to improve the generalization ability of deep learning-based solvers for Traveling Salesman Problem (TSP).
Tsplib—a traveling salesman problem library
Gerhard Reinelt · 1991
Earlier work this paper cites.
Planning in the presence of cost functions controlled by an adversary
H Brendan McMahan, Geoffrey J Gordon, and Avrim Blum · 2003
Earlier work this paper cites.
Methods for empirical game-theoretic analysis
Michael P Wellman · 2006
Earlier work this paper cites.
Using response functions to measure strategy strength
Trevor Davis, Neil Burch, and Michael Bowling · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems
Keld Helsgaun · 2017
Earlier work this paper cites.
Learning combinatorial optimization algorithms over graphs
Elias B. Khalil, Hanjun Dai, Yuyu Zhang, Bistra Dilkina, and Le Song · 2017
Earlier work this paper cites.
A unified game-theoretic approach to multiagent reinforcement learning
Marc Lanctot, Vinícius Flores Zambaldi, Audrunas Gruslys, Angeliki Lazaridou, Karl Tuyls, Julien Pérolat, David Silver, and Thore Graepel · 2017
Earlier work this paper cites.
Open-ended learning in symmetric zero-sum games
David Balduzzi, Marta Garnelo, Yoram Bachrach, Wojciech Czarnecki, Julien Perolat, Max Jaderberg, and Thore Graepel · 2019
Earlier work this paper cites.
Attention, learn to solve routing problems!
Wouter Kool, Herke van Hoof, and Max Welling · 2019
Cited alongside, same era.
Learning deep graph matching with channel-independent embedding and hungarian attention
Tianshu Yu, Runzhong Wang, Junchi Yan, and Baoxin Li · 2019
Cited alongside, same era.
Real world games look like spinning tops
Wojciech M. Czarnecki, Gauthier Gidel, Brendan D. Tracey, Karl Tuyls, Shayegan Omidshafiei, David Balduzzi, and Max Jaderberg · 2020
Cited alongside, same era.
A learning-based iterative method for solving vehicle routing problems
Hao Lu, Xingwen Zhang, and Shuang Yang · 2020
Cited alongside, same era.
Pipeline PSRO: A scalable approach for finding approximate nash equilibria in large games
Stephen McAleer, John B. Lanier, Roy Fox, and Pierre Baldi · 2020
Cited alongside, same era.
Learning a latent search space for routing problems using variational autoencoders
André Hottung, Bhanu Bhandari, and Kevin Tierney · 2021
Closest in time.
Deep policy dynamic programming for vehicle routing problems
Wouter Kool, Herke van Hoof, Joaquim Gromicho, and Max Welling · 2021
Closest in time.
Unifying behavioral and response diversity for open-ended learning in zero-sum games
Xiangyu Liu, Hangtian Jia, Ying Wen, Yaodong Yang, Yujing Hu, Yingfeng Chen, Changjie Fan, and Zhipeng Hu · 2021
Closest in time.
Modelling behavioural diversity for learning in open-ended games
Nicolas Perez Nieves, Yaodong Yang, Oliver Slumbers, David Henry Mguni, Ying Wen, and Jun Wang · 2021
Closest in time.
Measuring the non-transitivity in chess
Ricky Sanjaya, Jun Wang, and Yaodong Yang · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Max Olan Smith, Thomas Anthony, Yongzhao Wang, and Michael P Wellman · 2020
Cited alongside, same era.
An overview of multi-agent reinforcement learning from game theoretical perspective
Yaodong Yang and Jun Wang · 2020
Cited alongside, same era.
Generalize a small pre-trained model to arbitrarily large TSP instances
Zhang-Hua Fu, Kai-Bin Qiu, and Hongyuan Zha · 2021
Cited alongside, same era.
Gurobi Optimizer Reference Manual, 2021
Gurobi Optimization, LLC · 2021
Cited alongside, same era.
Or-tools
Laurent Perron and Vincent Furnon
Cited in the paper.
Closest in time.
Iterative empirical game solving via single policy best response
Max Olan Smith, Thomas Anthony, and Michael P. Wellman · 2021
Closest in time.
Learning improvement heuristics for solving routing problems.
Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, and Andrew Lim · 2021
Closest in time.
Deep latent graph matching
Tianshu Yu, Runzhong Wang, Junchi Yan, and Baoxin Li · 2021
Closest in time.