Fetching the paper…
Reading the bibliography…
Deep reinforcement learning (DRL)-based combinatorial optimization (CO) methods (i.e., DRL-NCO) have shown significant merit over the conventional CO solvers as DRL-NCO is capable of learning CO solvers less relying on problem-specific expert domain knowledge (heuristic method) and supervised labeled data (supervised learning method).
Tsplib—a traveling salesman problem library
Gerhard Reinelt · 1991
Earlier work this paper cites.
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Ronald J Williams · 1992
Earlier work this paper cites.
Pointer networks
Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly · 2015
Earlier work this paper cites.
Device placement optimization with reinforcement learning
Azalia Mirhoseini, Hieu Pham, Quoc V. Le, Benoit Steiner, Rasmus Larsen, Yuefeng Zhou, Naveen Kumar, Mohammad Norouzi, Samy Bengio, and Jeff Dean · 2017
Earlier work this paper cites.
Neural combinatorial optimization with reinforcement learning, 2017
Irwan Bello, Hieu Pham, Quoc V. Le, Mohammad Norouzi, and Samy Bengio · 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.
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 Khalil, Hanjun Dai, Yuyu Zhang, Bistra Dilkina, and Le Song · 2017
Earlier work this paper cites.
Reinforcement learning for solving the vehicle routing problem
Mohammadreza Nazari, Afshin Oroojlooy, Lawrence Snyder, and Martin Takác · 2018
Earlier work this paper cites.
An efficient evolutionary algorithm for the orienteering problem
Gorka Kobeaga, María Merino, and Jose A Lozano · 2018
Earlier work this paper cites.
Combinatorial optimization with graph convolutional networks and guided tree search
Zhuwen Li, Qifeng Chen, and Vladlen Koltun · 2018
Earlier work this paper cites.
Neural large neighborhood search for the capacitated vehicle routing problem
André Hottung and Kevin Tierney · 2019
Earlier work this paper cites.
Attention, learn to solve routing problems!
Wouter Kool, Herke van Hoof, and Max Welling · 2019
Earlier work this paper cites.
Learning to perform local rewriting for combinatorial optimization
Xinyun Chen and Yuandong Tian · 2019
Earlier work this paper cites.
Solving np-hard problems on graphs with extended alphago zero
Kenshin Abe, Zijian Xu, Issei Sato, and Masashi Sugiyama · 2019
Earlier work this paper cites.
Deep learning for intelligent transportation systems: A survey of emerging trends
Matthew Veres and Medhat Moussa · 2020
Earlier work this paper cites.
Guiding deep molecular optimization with genetic exploration
Sungsoo Ahn, Junsu Kim, Hankook Lee, and Jinwoo Shin · 2020
Earlier work this paper cites.
Chip placement with deep reinforcement learning
Azalia Mirhoseini, Anna Goldie, Mustafa Yazgan, Joe Jiang, Ebrahim M. Songhori, Shen Wang, Young-Joon Lee, Eric Johnson, Omkar Pathak, Sungmin Bae, Azade Nazi, Jiwoo Pak, Andy Tong, Kavya Srinivasa, William Hang, Emre Tuncer, Anand Babu, Quoc V. Le, James Laudon, Richard C. Ho, Roger Carpenter, and Jeff Dean · 2020
Cited alongside, same era.
Attention routing: track-assignment detailed routing using attention-based reinforcement learning, 2020
Haiguang Liao, Qingyi Dong, Xuliang Dong, Wentai Zhang, Wangyang Zhang, Weiyi Qi, Elias Fallon, and Levent Burak Kara · 2020
Cited alongside, same era.
Reinforcement learning-based auto-router considering signal integrity
Minsu Kim, Hyunwook Park, Seongguk Kim, Keeyoung Son, Subin Kim, Kyunjune Son, Seonguk Choi, Gapyeol Park, and Joungho Kim · 2020
Cited alongside, same era.
Learning tsp requires rethinking generalization, 2020
Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, Thomas Laurent, and Xavier Bresson · 2020
Cited alongside, same era.
Generalize a small pre-trained model to arbitrarily large tsp instances, 2020
Learning to solve combinatorial optimization problems on real-world graphs in linear time
Iddo Drori, Anant Kharkar, William R Sickinger, Brandon Kates, Qiang Ma, Suwen Ge, Eden Dolev, Brenda Dietrich, David P Williamson, and Madeleine Udell · 2020
Later among the works it cites.
A deep learning algorithm for the max-cut problem based on pointer network structure with supervised learning and reinforcement learning strategies
Shenshen Gu and Yue Yang · 2020
Later among the works it cites.
Spanning tree-based graph generation for molecules
Sungsoo Ahn, Binghong Chen, Tianzhe Wang, and Le Song · 2021
Later among the works it cites.
Imitation learning for simultaneous escape routing
Minsu Kim, Hyunwook Park, Keeyoung Son, Seongguk Kim, Haeyeon Kim, Jihun Kim, Jinwook Song, Youngmin Ku, Jounggyu Park, and Joungho Kim · 2021
Later among the works it cites.
Deep policy dynamic programming for vehicle routing problems
Wouter Kool, Herke van Hoof, Joaquim A. S. Gromicho, and Max Welling · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Zhang-Hua Fu, Kai-Bin Qiu, and Hongyuan Zha · 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 improvement heuristics for solving routing problems, 2020
Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, and Andrew Lim · 2020
Cited alongside, same era.
Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning
Paulo R d O da Costa, Jason Rhuggenaath, Yingqian Zhang, and Alp Akcay · 2020
Cited alongside, same era.
Learning what to defer for maximum independent sets
Sungsoo Ahn, Younggyo Seo, and Jinwoo Shin · 2020
Cited alongside, same era.
Pomo: Policy optimization with multiple optima for reinforcement learning
Yeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon, Youngjune Gwon, and Seungjai Min · 2020
Cited alongside, same era.
A simple framework for contrastive learning of visual representations
Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton · 2020
Cited alongside, same era.
Permutation invariant graph generation via score-based generative modeling
Chenhao Niu, Yang Song, Jiaming Song, Shengjia Zhao, Aditya Grover, and Stefano Ermon · 2020
Cited alongside, same era.
Later among the works it cites.
Learning collaborative policies to solve np-hard routing problems
Minsu Kim, Jinkyoo Park, and Joungho Kim · 2021
Later among the works it cites.
Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning
Junyoung Park, Jaehyeong Chun, Sang Hun Kim, Youngkook Kim, and Jinkyoo Park · 2021
Later among the works it cites.
Learning to iteratively solve routing problems with dual-aspect collaborative transformer
Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, and Jing Tang · 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.
Schedulenet: Learn to solve multi-agent scheduling problems with reinforcement learning
Junyoung Park, Sanjar Bakhtiyar, and Jinkyoo Park · 2021
Later among the works it cites.
Rewriting by generating: Learn heuristics for large-scale vehicle routing problems, 2021
Hansen Wang, Zefang Zong, Tong Xia, Shuyu Luo, Meng Zheng, Depeng Jin, and Yong Li · 2021
Later among the works it cites.
E (n) equivariant graph neural networks
Vıéctor Garcia Satorras, Emiel Hoogeboom, and Max Welling · 2021
Later among the works it cites.
Generalization in deep rl for tsp problems via equivariance and local search
Wenbin Ouyang, Yisen Wang, Paul Weng, and Shaochen Han · 2021
Later among the works it cites.
Graph neural network guided local search for the traveling salesperson problem
Benjamin Hudson, Qingbiao Li, Matthew Malencia, and Amanda Prorok · 2021
Later among the works it cites.
Efficient active search for combinatorial optimization problems
André Hottung, Yeong-Dae Kwon, and Kevin Tierney · 2021
Later among the works it cites.
Learning to solve combinatorial graph partitioning problems via efficient exploration
Thomas D Barrett, Christopher WF Parsonson, and Alexandre Laterre · 2022
Closest in time.