Fetching the paper…
Reading the bibliography…
Current methods for end-to-end constructive neural combinatorial optimization usually train a policy using behavior cloning from expert solutions or policy gradient methods from reinforcement learning.
Statistical theory of extreme values and some practical applications: a series of lectures , volume 33
E.J. Gumbel · 1954
Earlier work this paper cites.
The relationship between luce’s choice axiom, thurstone’s theory of comparative judgment, and the double exponential distribution
J.I. Yellott Jr · 1977
Earlier work this paper cites.
The vehicle routing problem: An overview of exact and approximate algorithms
Gilbert Laporte · 1992
Earlier work this paper cites.
Simple statistical gradient-following algorithms for connectionist reinforcement learning
R.J. Williams · 1992
Earlier work this paper cites.
Benchmarks for basic scheduling problems
E. Taillard · 1993
Earlier work this paper cites.
Combinatorial optimization models for production scheduling in automated manufacturing systems
Yves Crama · 1997
Earlier work this paper cites.
The cross-entropy method for combinatorial and continuous optimization
Reuven Rubinstein · 1999
Earlier work this paper cites.
Local search in combinatorial optimization
Yves Crama, Antoon WJ Kolen, and EJ Pesch · 2005
Earlier work this paper cites.
A tutorial on the cross-entropy method
Pieter-Tjerk De Boer, Dirk P Kroese, Shie Mannor, and Reuven Y Rubinstein · 2005
Earlier work this paper cites.
The traveling salesman problem: a computational study
D.L. Applegate, R.E. Bixby, V. Chvatal, and W.J. Cook · 2006
Earlier work this paper cites.
Ant colony optimization
Marco Dorigo, Mauro Birattari, and Thomas Stutzle · 2006
Earlier work this paper cites.
Combinatorial optimization and green logistics
Abdelkader Sbihi and Richard W Eglese · 2010
Earlier work this paper cites.
Nature-inspired metaheuristic algorithms
Xin-She Yang · 2010
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
A* sampling
Chris J Maddison, Daniel Tarlow, and Tom Minka · 2014
Earlier work this paper cites.
Gumbel-max trick and weighted reservoir sampling
T. Vieira · 2014
Earlier work this paper cites.
Pointer networks
Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly · 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.
A simple, fast diverse decoding algorithm for neural generation
J. Li, W. Monroe, and D. Jurafsky · 2016
Earlier work this paper cites.
Self-critical sequence training for image captioning
S.J. Rennie, E. Marcheret, Y. Mroueh, J. Ross, and V. Goel · 2017
Earlier work this paper cites.
Proximal policy optimization algorithms
John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov · 2017
Earlier work this paper cites.
Attention is all you need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin · 2017
Earlier work this paper cites.
Learning heuristics for the tsp by policy gradient
Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak, and Louis-Martin Rousseau · 2018
Earlier work this paper cites.
Deep reinforcement learning that matters
Peter Henderson, Riashat Islam, Philip Bachman, Joelle Pineau, Doina Precup, and David Meger · 2018
Earlier work this paper cites.
Reinforcement learning for solving the vehicle routing problem
Mohammadreza Nazari, Afshin Oroojlooy, Lawrence Snyder, and Martin Takác · 2018
Cited alongside, same era.
Diverse beam search for improved description of complex scenes
A. Vijayakumar, M. Cogswell, R. Selvaraju, Q. Sun, S. Lee, D. Crandall, and D. Batra · 2018
Cited alongside, same era.
Learning to perform local rewriting for combinatorial optimization
Xinyun Chen and Yuandong Tian · 2019
Cited alongside, same era.
An efficient graph convolutional network technique for the travelling salesman problem
Chaitanya K Joshi, Thomas Laurent, and Xavier Bresson · 2019
Cited alongside, same era.
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, et al · 2019
Cited alongside, same era.
Learning improvement heuristics for solving routing problems
Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, and Andrew Lim · 2021
Later among the works it cites.
Multi-decoder attention model with embedding glimpse for solving vehicle routing problems
Liang Xin, Wen Song, Zhiguang Cao, and Jie Zhang · 2021
Later among the works it cites.
Learning to solve vehicle routing problems: A survey
Aigerim Bogyrbayeva, Meraryslan Meraliyev, Taukekhan Mustakhov, and Bissenbay Dauletbayev · 2022
Later among the works it cites.
Simulation-guided beam search for neural combinatorial optimization
Jinho Choo, Yeong-Dae Kwon, Jihoon Kim, Jeongwoo Jae, André Hottung, Kevin Tierney, and Youngjune Gwon · 2022
Later among the works it cites.
Policy improvement by planning with gumbel
Ivo Danihelka, Arthur Guez, Julian Schrittwieser, and David Silver · 2022
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 what to defer for maximum independent sets
Sungsoo Ahn, Younggyo Seo, and Jinwoo Shin · 2020
Cited alongside, same era.
Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning
Paulo R d O Costa, Jason Rhuggenaath, Yingqian Zhang, and Alp Akcay · 2020
Cited alongside, same era.
The curious case of neural text degeneration
Ari Holtzman, Jan Buys, Li Du, Maxwell Forbes, and Yejin Choi · 2020
Cited alongside, same era.
Neural large neighborhood search for the capacitated vehicle routing problem
André Hottung and Kevin Tierney · 2020
Cited alongside, same era.
Learning a latent search space for routing problems using variational autoencoders
André Hottung, Bhanu Bhandari, and Kevin Tierney · 2020
Cited alongside, same era.
Learning the travelling salesperson problem requires rethinking generalization
Chaitanya K Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent · 2020
Cited alongside, same era.
Estimating gradients for discrete random variables by sampling without replacement
W. Kool, H. van Hoof, and M. Welling · 2020
Cited alongside, same era.
Efficient active search for combinatorial optimization problems
André Hottung, Yeong-Dae Kwon, and Kevin Tierney · 2022
Later among the works it cites.
A review of the gumbel-max trick and its extensions for discrete stochasticity in machine learning
I.A.M. Huijben, W. Kool, M.B. Paulus, and R.J.G. van Sloun · 2022
Later among the works it cites.
Sym-NCO: Leveraging symmetricity for neural combinatorial optimization
Minsu Kim, Junyoung Park, and Jinkyoo Park · 2022
Later among the works it cites.
Deep policy dynamic programming for vehicle routing problems
Wouter Kool, Herke van Hoof, Joaquim Gromicho, and Max Welling · 2022
Later among the works it cites.
Schedulenet: Learn to solve multi-agent scheduling problems with reinforcement learning, 2022
Junyoung Park, Sanzhar Bakhtiyarov, and Jinkyoo Park · 2022
Later among the works it cites.
Or-tools. google
Laurent Perron and Vincent Furnon · 2022
Later among the works it cites.
Train short, test long: Attention with linear biases enables input length extrapolation
Ofir Press, Noah Smith, and Mike Lewis · 2022
Later among the works it cites.
Hybrid genetic search for the cvrp: Open-source implementation and swap* neighborhood
Thibaut Vidal · 2022
Later among the works it cites.
An end-to-end deep reinforcement learning approach for job shop scheduling
Linlin Zhao, Weiming Shen, Chunjiang Zhang, and Kunkun Peng · 2022
Later among the works it cites.
Bq-nco: Bisimulation quotienting for efficient neural combinatorial optimization
Darko Drakulic, Sofia Michel, Florian Mai, Arnaud Sors, and Jean-Marc Andreoli · 2023
Later among the works it cites.
Large language models can self-improve
Jiaxin Huang, Shixiang Shane Gu, Le Hou, Yuexin Wu, Xuezhi Wang, Hongkun Yu, and Jiawei Han · 2023
Later among the works it cites.
Neural combinatorial optimization with heavy decoder: Toward large scale generalization
Fu Luo, Xi Lin, Fei Liu, Qingfu Zhang, and Zhenkun Wang · 2023
Later among the works it cites.
Lightzero: A unified benchmark for monte carlo tree search in general sequential decision scenarios
Yazhe Niu, Yuan Pu, Zhenjie Yang, Xueyan Li, Tong Zhou, Jiyuan Ren, Shuai Hu, Hongsheng Li, and Yu Liu · 2023
Later among the works it cites.
Policy-based self-competition for planning problems
Jonathan Pirnay, Quirin Göttl, Jakob Burger, and Dominik Gerhard Grimm · 2023
Later among the works it cites.
Combinatorial optimization with policy adaptation using latent space search
Felix Chalumeau, Shikha Surana, Clément Bonnet, Nathan Grinsztajn, Arnu Pretorius, Alexandre Laterre, and Tom Barrett · 2024
Closest in time.
Self-labeling the job shop scheduling problem
Andrea Corsini, Angelo Porrello, Simone Calderara, and Mauro Dell’Amico · 2024
Closest in time.
Winner takes it all: Training performant rl populations for combinatorial optimization
Nathan Grinsztajn, Daniel Furelos-Blanco, Shikha Surana, Clément Bonnet, and Tom Barrett · 2024
Closest in time.
Deep reinforcement learning guided improvement heuristic for job shop scheduling
Cong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu, and Jie Zhang · 2024
Closest in time.