Fetching the paper…
Reading the bibliography…
Applying machine learning to combinatorial optimization problems has the potential to improve both efficiency and accuracy.
E. Balas, “The prize collecting traveling salesman problem,” Networks
1989
Earlier work this paper cites.
G. Reinelt, “Tsplib—a traveling salesman problem library,” ORSA journal on computing
1991
Earlier work this paper cites.
B. Treutwein, “Adaptive psychophysical procedures,” Vision research
1995
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Flat minima,” Neural computation
1997
Earlier work this paper cites.
Y. Bengio, J. Louradour, R. Collobert, and J. Weston, “Curriculum learning,” in Proceedings of the 26th annual international conference on machine learning
2009
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” Advances in neural information processing systems
2014
Earlier work this paper cites.
SIAM, 2014
P. Toth and D. Vigo, Vehicle routing: problems, methods, and applications · 2014
Earlier work this paper cites.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” in Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada
2015
Earlier work this paper cites.
K. Smith-Miles and S. Bowly, “Generating new test instances by evolving in instance space,” Computers & Operations Research
2015
Earlier work this paper cites.
A. Pentina, V. Sharmanska, and C. H. Lampert, “Curriculum learning of multiple tasks,” 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
2015
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings
2015
Earlier work this paper cites.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” Advances in neural information processing systems
2017
Earlier work this paper cites.
L. Dinh, J. Sohl-Dickstein, and S. Bengio, “Density estimation using real NVP,” in 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings
2017
Earlier work this paper cites.
E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, T. Vidal, and A. Subramanian, “New benchmark instances for the capacitated vehicle routing problem,” European Journal of Operational Research
2017
Earlier work this paper cites.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” in 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Workshop Track Proceedings
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” in Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
M. Lanctot, V. F. Zambaldi, A. Gruslys, A. Lazaridou, K. Tuyls, J. Pérolat, D. Silver, and T. Graepel, “A unified game-theoretic approach to multiagent reinforcement learning,” in Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA
2017
Earlier work this paper cites.
C. Florensa, D. Held, M. Wulfmeier, M. Zhang, and P. Abbeel, “Reverse curriculum generation for reinforcement learning,” in Conference on robot learning
2017
Earlier work this paper cites.
K. Helsgaun, “An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems,” Roskilde: Roskilde University
2017
Earlier work this paper cites.
L. Dinh, R. Pascanu, S. Bengio, and Y. Bengio, “Sharp minima can generalize for deep nets,” in International Conference on Machine Learning
2017
Cited alongside, same era.
N. S. Keskar, D. Mudigere, J. Nocedal, M. Smelyanskiy, and P. T. P. Tang, “On large-batch training for deep learning: Generalization gap and sharp minima,” in 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings
2017
Cited alongside, same era.
N. S. Keskar, D. Mudigere, J. Nocedal, M. Smelyanskiy, and P. T. P. Tang, “On large-batch training for deep learning: Generalization gap and sharp minima,” in 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings
2017
Cited alongside, same era.
S. Guo, W. Huang, H. Zhang, C. Zhuang, D. Dong, M. R. Scott, and D. Huang, “Curriculumnet: Weakly supervised learning from large-scale web images,” in Proceedings of the European conference on computer vision (ECCV)
R. Portelas, C. Colas, L. Weng, K. Hofmann, and P.-Y. Oudeyer, “Automatic curriculum learning for deep rl: A short survey,” in IJCAI
2020
Later among the works it cites.
A. Hottung, B. Bhandari, and K. Tierney, “Learning a latent search space for routing problems using variational autoencoders,” in International Conference on Learning Representations
2020
Later among the works it cites.
X. Chen and C.-J. Hsieh, “Stabilizing differentiable architecture search via perturbation-based regularization,” in International conference on machine learning
2020
Later among the works it cites.
Y. Wu, W. Song, Z. Cao, J. Zhang, and A. Lim, “Learning improvement heuristics for solving routing problems..,” IEEE Transactions on Neural Networks and Learning Systems
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
Z. Ren, D. Dong, H. Li, and C. Chen, “Self-paced prioritized curriculum learning with coverage penalty in deep reinforcement learning,” IEEE transactions on neural networks and learning systems
2018
Cited alongside, same era.
M. Nazari, A. Oroojlooy, L. V. Snyder, and M. Takác, “Reinforcement learning for solving the vehicle routing problem,” in Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montréal, Canada
2018
Cited alongside, same era.
W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!,” in 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019
2019
Cited alongside, same era.
F. Agostinelli, S. McAleer, A. Shmakov, and P. Baldi, “Solving the rubik’s cube with deep reinforcement learning and search,” Nature Machine Intelligence
2019
Cited alongside, same era.
Y. Tay, S. Wang, A. T. Luu, J. Fu, M. C. Phan, X. Yuan, J. Rao, S. C. Hui, and A. Zhang, “Simple and effective curriculum pointer-generator networks for reading comprehension over long narratives,” in Proceedings of the 57th Conference of the Association for Computational Linguistics, ACL 2019, Florence, Italy, July 28- August 2, 2019, Volume 1: Long Papers
2019
Cited alongside, same era.
E. A. Platanios, O. Stretcu, G. Neubig, B. Póczos, and T. M. Mitchell, “Competence-based curriculum learning for neural machine translation,” in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019, Minneapolis, MN, USA, June 2-7, 2019, Volume 1 (Long and Short Papers)
2019
Cited alongside, same era.
2019
Cited alongside, same era.
X. Chen and Y. Tian, “Learning to perform local rewriting for combinatorial optimization,” Advances in Neural Information Processing Systems
2019
Cited alongside, same era.
2021
Later among the works it cites.
Z. Fu, K. Qiu, and H. Zha, “Generalize a small pre-trained model to arbitrarily large TSP instances,” in Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
N. Perez-Nieves, Y. Yang, O. Slumbers, D. H. Mguni, Y. Wen, and J. Wang, “Modelling behavioural diversity for learning in open-ended games,” in International Conference on Machine Learning
2021
Later among the works it cites.
H. Fu, W. Liu, S. Wu, Y. Wang, T. Yang, K. Li, J. Xing, B. Li, B. Ma, Q. Fu, et al
2021
Later among the works it cites.
Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” 2021
2021
Later among the works it cites.
L. Xin, W. Song, Z. Cao, and J. Zhang, “Multi-decoder attention model with embedding glimpse for solving vehicle routing problems,” in Proceedings of the AAAI Conference on Artificial Intelligence
2021
Later among the works it cites.
W. Kool, H. van Hoof, J. A. S. Gromicho, and M. Welling, “Deep policy dynamic programming for vehicle routing problems,” in Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings
2022
Later among the works it cites.
Z. Zhang, Z. Zhang, X. Wang, and W. Zhu, “Learning to solve travelling salesman problem with hardness-adaptive curriculum,” in AAAI
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Perolat, B. De Vylder, D. Hennes, E. Tarassov, F. Strub, V. de Boer, P. Muller, J. T. Connor, N. Burch, T. Anthony, et al
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
H. Li, Z. Xu, G. Taylor, C. Studer, and T. Goldstein, “Visualizing the loss landscape of neural nets,” Advances in neural information processing systems
2030
Closest in time.