A Survey on Reinforcement Learning for Combinatorial Optimization

R. Bellman, “Dynamic programming,” Science , vol. 153, pp. 34 – 37, 1957

1957

Earlier work this paper cites.

R. L. Karg and G. L. Thompson, “A heuristic approach to solving travelling salesman problems,” Management Science , vol. 10, pp. 225–248, 1964

1964

Earlier work this paper cites.

D. E. Kirk, “Optimal control theory: an introduction,” 1970

1970

Earlier work this paper cites.

G. W. Graves and A. Whinston, “An algorithm for the quadratic assignment problem,” Management Science , vol. 16, pp. 453–471, 1970

1970

Earlier work this paper cites.

C. J. C. H. Watkins, “Learning with delayed rewards,” 1989

1989

Earlier work this paper cites.

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “Introduction to algorithms,” 1990

1990

Earlier work this paper cites.

R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,” Machine Learning , vol. 8, pp. 229–256, 1992

1992

Earlier work this paper cites.

L. M. Gambardella and M. Dorigo, “Ant-q: A reinforcement learning approach to the traveling salesman problem,” in Machine Learning Proceedings 1995 , A. Prieditis and S. Russell, Eds. San Francisco (CA): Morgan Kaufmann, 1995, pp. 252–260

1995

Earlier work this paper cites.

L. P. Kaelbling, M. L. Littman, and A. W. Moore, “Reinforcement learning: A survey,” J. Artif. Intell. Res. , vol. 4, pp. 237–285, 1996

1996

Earlier work this paper cites.

M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society , vol. 26 1, pp. 29–41, 1996

1996

Cited alongside, same era.

V. G. Deineko and E. Çela, “The quadratic assignment problem: Theory and algorithms,” 1998

1998

Cited alongside, same era.

R. Carr, “Simulated annealing,” 2002

2002

Cited alongside, same era.

K. M. Anstreicher, “Recent advances in the solution of quadratic assignment problems,” Mathematical Programming , vol. 97, pp. 27–42, 2003

2003

Cited alongside, same era.

R. S. Sutton and A. G. Barto, “Reinforcement learning: An introduction,” IEEE Transactions on Neural Networks , vol. 16, pp. 285–286, 2005

2005

Cited alongside, same era.

K. Arulkumaran, M. P. Deisenroth, M. Brundage, and A. A. Bharath, “Deep reinforcement learning: A brief survey,” IEEE Signal Processing Magazine , vol. 34, pp. 26–38, 2017

2017

Later among the works it cites.

T. Haarnoja, A. Zhou, K. Hartikainen, G. Tucker, S. Ha, J. Tan, V. Kumar, H. Zhu, A. Gupta, P. Abbeel, and S. Levine, “Soft actor-critic algorithms and applications,” ArXiv , vol. abs/1812.05905, 2018

Original

2018

Later among the works it cites.

V. François-Lavet, P. Henderson, R. Islam, M. G. Bellemare, and J. Pineau, “An introduction to deep reinforcement learning,” Found. Trends Mach. Learn. , vol. 11, pp. 219–354, 2018

2018

Later among the works it cites.

W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!” in International Conference on Learning Representations , 2018

2018

Later among the works it cites.

S. Tanwar, “Bellman equation and dynamic programming,” 2019