The DOI matches its Crossref record; 113 of the 113 references it cites were found in a registry or an index.
Reinforcement learning for combinatorial optimization: A survey
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation
Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1179 · Cited by 25,545
Semi-supervised classification with graph convolutional networks
Kipf, T. N., & Welling, M. (2016) · arXiv · doi:10.48550/arxiv.1609.02907 · Cited by 24,853
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
(1999) · Cited by 5,147
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Neural Message Passing for Quantum Chemistry
Gilmer, J., Schoenholz, S. S., Riley, P. F., Vinyals, O., & Dahl, G. E. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01212 · Cited by 3,440
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 3,416
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Formal Semantics for Kolmogorov-Arnold Network Representations of Operational Games
Zhukov, G. A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.15206559 · Cited by 3,212
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. (2020) · UTS ePRESS (University of Technology Sydney) · Cited by 3,174
A Survey of Monte Carlo Tree Search Methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2186810 · Cited by 2,970
Integer Programming Formulation of Traveling Salesman Problems
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960) · Journal of the ACM · doi:10.1145/321043.321046 · Cited by 2,555
Bellman, R. (1957) · Indiana University Mathematics Journal · doi:10.1512/iumj.1957.6.56038 · Cited by 2,408
Self-Critical Sequence Training for Image Captioning
Rennie, S. J., Marcheret, E., Mroueh, Y., Ross, J., & Goel, V. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.131 · Cited by 2,112
Vinyals, O., Fortunato, M., & Jaitly, N. (2015) · neural information processing systems · Cited by 2,043
Probability and computing: randomized algorithms and probabilistic analysis
Mitzenmacher, M., & Upfal, E. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,824
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Helsgaun, K. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00284-2 · Cited by 1,630
A Method for Solving Traveling-Salesman Problems
Croes, G. A. (1958) · Operations Research · doi:10.1287/opre.6.6.791 · Cited by 1,570
Mastering Atari, Go, chess and shogi by planning with a learned model
Schrittwieser, J., Antonoglou, I., Hubert, T., Simonyan, K., Sifre, L., Schmitt, S., Guez, A., Lockhart, E., Hassabis, D., Graepel, T., et al. (2020) · RePEc: Research Papers in Economics · Cited by 1,310
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
Mastering Atari, Go, chess and shogi by planning with a learned model
Schrittwieser, J., Antonoglou, I., Hubert, T., Simonyan, K., Sifre, L., Schmitt, S., Guez, A., Lockhart, E., Hassabis, D., Graepel, T., et al. (2020) · Nature · doi:10.1038/s41586-020-03051-4 · Cited by 1,214
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.01815 · Cited by 1,102
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Learning Combinatorial Optimization Algorithms over Graphs
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01665 · Cited by 1,007
On the theory of dynamic programming
Bellman, R. (1952) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.38.8.716 · Cited by 998
Deep Q-learning From Demonstrations
Hester, T., Vecerik, M., Pietquin, O., Lanctot, M., Schaul, T., Piot, B., Horgan, D., Quan, J., Sendonaris, A., Osband, I., et al. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11757 · Cited by 889
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J. (1992) · Machine Learning · doi:10.1023/a:1022672621406 · Cited by 817
Dynamic Programming Treatment of the Travelling Salesman Problem
Bellman, R. (1962) · Journal of the ACM · doi:10.1145/321105.321111 · Cited by 808
Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networks
Lee, J., Lee, Y., Kim, J., Kosiorek, A. R., Choi, S., & Teh, Y. W. (2018) · arXiv · doi:10.48550/arxiv.1810.00825 · Cited by 691
The Option-Critic Architecture
Bacon, P.-L., Harb, J., & Precup, D. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10916 · Cited by 687
Efficient Graphlet Kernels for Large Graph Comparison
Sherashidze, N., Vishwanathan, S. V. N., Petri, T., Mehlhorn, K., & Borgwardt, K. M. (2009) · MPG.PuRe (Max Planck Society) · Cited by 644
On the hardness of approximating vertex cover
Dinur, I., & Safra, S. (2005) · Annals of Mathematics · doi:10.4007/annals.2005.162.439 · Cited by 636
Finding a Maximum Independent Set
Tarjan, R. E., & Trojanowski, A. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206038 · Cited by 474
Discriminative Embeddings of Latent Variable Models for Structured Data
Dai, H., Dai, B., & Song, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05629 · Cited by 454
Finding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366
Learning Improvement Heuristics for Solving Routing Problems
Wu, Y., Song, W., Cao, Z., Zhang, J., & Lim, A. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3068828 · Cited by 344
Linear Programming-1: Introduction.
Dave, U., Dantzig, G. B., & Thapa, M. N. (1998) · The Journal of the Operational Research Society · doi:10.2307/3010109 · Cited by 324
Learning to Perform Local Rewriting for Combinatorial OptimizationPreprint
Chen, X., & Tian, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00337 · Cited by 322
A Learning-based Iterative Method for Solving Vehicle Routing Problems
Hao, L., Zhang, X., & Yang, S. (2020) · International Conference on Learning Representations · Cited by 320
Learning Heuristics for the TSP by Policy Gradient
Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., & Rousseau, L.-M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93031-2_12 · Cited by 303
Lower bounds and reduction procedures for the bin packing problem
Martello, S., & Toth, P. (1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90094-s · Cited by 291
Deep Q-learning from Demonstrations
Hester, T., Vecerík, M., Pietquin, O., Lanctot, M., Schaul, T., Piot, B., Horgan, D., Quan, J., Sendonaris, A., Dulac-Arnold, G., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.03732 · Cited by 270
Coherent Ising machines—optical neural networks operating at the quantum limit
Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0048-9 · Cited by 258
Neural Combinatorial Optimization with Reinforcement Learning
Bello, I., Pham, H., Le, Q. V., Norouzi, M., & Bengio, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.09940 · Cited by 257
IBM ILOG CPLEX Optimization Studio
Nickel, S., Steinhardt, C., Schlenker, H., Burkart, W., & Reuter-Oppermann, M. (2021) · Angewandte Optimierung mit IBM ILOG CPLEX Optimization Studio · doi:10.1007/978-3-662-62185-1_2 · Cited by 254
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
Cappart, Q., Moisan, T., Rousseau, L.-M., Prémont-Schwarz, I., & Ciré, A. A. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i5.16484 · Cited by 225
Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement LearningPreprint
Ma, Q., Ge, S., He, D., Thaker, D., & Drori, I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.04936 · Cited by 224
Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning
da Costa, P. R. D. O., Rhuggenaath, J., Zhang, Y., & Akçay, A. (2020) · TU/e Research Portal · doi:10.48550/arxiv.2004.01608 · Cited by 222
Latent Space Policies for Hierarchical Reinforcement LearningPreprint
Haarnoja, T., Hartikainen, K., Abbeel, P., & Levine, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.02808 · Cited by 200
Thinking Fast and Slow with Deep Learning and Tree Search
Anthony, T., Tian, Z., & Barber, D. (2017) · arXiv · doi:10.48550/arxiv.1705.08439 · Cited by 198
SNPs Problems, Complexity, and Algorithms
Lancia, G., Bafna, V., Istrail, S., Lippert, R., & Schwartz, R. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44676-1_15 · Cited by 198
(2012) · Linear Programming and Algorithms for Communication Networks · doi:10.1201/b12733-4 · Cited by 196
Machine learning for combinatorial optimization: A methodological tour d'horizon
Bengio, Y., Lodi, A., & Prouvost, A. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.07.063 · Cited by 195
Multidimensional Knapsack Problems
Kellerer, H. G., Pferschy, U., & Pisinger, D. (2004) · Springer eBooks · doi:10.1007/978-3-540-24777-7_9 · Cited by 180
Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning MethodPreprint
Hu, H., Zhang, X., Yan, X. S., Wang, L., & Xu, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.05930 · Cited by 172
Attention, Learn to Solve Routing Problems!
Kool, W., van Hoof, H., & Welling, M. (2018) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.1803.08475 · Cited by 171
Reinforcement Learning for Solving the Vehicle Routing Problem
Nazari, M., Oroojlooy, A., Snyder, L., & Takáč, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.04240 · Cited by 167
Destabilization of Local Minima in Analog Spin Systems by Correction of Amplitude Heterogeneity
Leleu, T. G., Yamamoto, Y., McMahon, P. L., & Aihara, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.040607 · Cited by 166
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
Vesselinova, N., Steinert, R., Perez-Ramirez, D. F., & Boman, M. (2020) · IEEE Access · doi:10.1109/access.2020.3004964 · Cited by 164
Exploratory Combinatorial Optimization with Reinforcement Learning
Barrett, T., Clements, W., Foerster, J., & Lvovsky, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5723 · Cited by 159
Dynamic Local Search for the Maximum Clique Problem
Pullan, W., & Hoos, H. H. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1815 · Cited by 158
A better approximation ratio for the vertex cover problem
Karakostas, G. (2009) · ACM Transactions on Algorithms · doi:10.1145/1597036.1597045 · Cited by 156
Reinforcement Learning for Integer Programming: Learning to CutPreprint
Tang, Y., Agrawal, S., & Faenza, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.04859 · Cited by 140
Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time
Drori, I., Kharkar, A., Sickinger, W. R., Kates, B., Ma, Q., Ge, S., Dolev, E., Dietrich, B. L., Williamson, D. P., & Udell, M. R. (2020) · International Conference on Machine Learning and Applications · doi:10.1109/icmla51294.2020.00013 · Cited by 137
A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems
Peng, B., Wang, J., & Zhang, Z. (2020) · Communications in computer and information science · doi:10.1007/978-981-15-5577-0_51 · Cited by 131
Learning Generalized Reactive Policies Using Deep Neural Networks
Groshev, E., Goldstein, M., Tamar, A., Srivastava, S., & Abbeel, P. (2018) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v28i1.13872 · Cited by 127
Learning Heuristics over Large Graphs via Deep Reinforcement LearningPreprint
Manchanda, S., Mittal, A., Dhawan, A., Medya, S., Ranu, S., & Singh, A. K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.03332 · Cited by 107
Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial OptimizationPreprint
Laterre, A., Fu, Y., Jabri, M. K., Cohen, A.-S., Kas, D., Hajjar, K., Dahl, T. S., Kerkeni, A., & Beguir, K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.01672 · Cited by 101
Annealing by simulating the coherent Ising machine
Tiunov, E. S., Ulanov, A. E., & Lvovsky, A. I. (2019) · Optics Express · doi:10.1364/oe.27.010288 · Cited by 94
Finding Near-Optimal Independent Sets at Scale
Lamm, S., Sanders, P. W., Schulz, C., et al. (2015) · Journal of Heuristics · doi:10.1007/s10732-017-9337-x · Cited by 91
Learn to Design the Heuristics for Vehicle Routing ProblemPreprint
Gao, L., Chen, M., Chen, Q., Luo, G., Zhu, N., & Liu, Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.08539 · Cited by 87
An evolutionary heuristic for the maximum independent set problem
Bäck, T., & Khuri, S. (2002) · doi:10.1109/icec.1994.350004 · Cited by 83
An effective local search for the maximum clique problem
Katayama, K., Akihiro, H., & Narihisa, H. (2005) · Information Processing Letters · doi:10.1016/j.ipl.2005.05.010 · Cited by 83
Learning Permutations with Sinkhorn Policy GradientPreprint
Emami, P., & Ranka, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07010 · Cited by 79
Solving NP-Hard Problems on Graphs with Extended AlphaGo ZeroPreprint
Abe, K., Xu, Z., Sato, I., & Sugiyama, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.11623 · Cited by 79
Boosting Combinatorial Problem Modeling with Machine Learning
Lombardi, M., & Milano, M. (2018) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/772 · Cited by 72
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion
Subhash, K., Minzer, D., & Safra, M. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00062 · Cited by 70
A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem
Duan, L., Hu, H., Yu, Q., Gong, Y. L., Zhang, X., Wei, J., & Xu, Y. (2019) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/phej7266 · Cited by 60
Graph-Theoretic Techniques for Macromolecular Docking
Gardiner, E. J., Willett, P., & Artymiuk, P. J. (1999) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci990262o · Cited by 59
Coloring Big Graphs with AlphaGoZeroPreprint
Huang, J., Patwary, M. M. A., & Diamos, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.10162 · Cited by 51
Cappart, Q., Goutierre, E., Bergman, D., & Rousseau, L.-M. (2019) · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · doi:10.1609/aaai.v33i01.33011443 · Cited by 49
Learning Goal Embeddings via Self-Play for Hierarchical Reinforcement LearningPreprint
Sukhbaatar, S., Denton, E., Szlam, A. D., & Fergus, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.09083 · Cited by 48
An Improved Algorithm for Optimal Bin Packing
Korf, R. E. (2003) · Cited by 44
Solving Combinatorial Problems with Machine Learning Methods
Guo, T., Han, C., Tang, S., & Ding, M. (2019) · Springer optimization and its applications · doi:10.1007/978-3-030-16194-1_9 · Cited by 40
Reinforcement Learning Driven Heuristic OptimizationPreprint
Cai, Q., Hang, W., Mirhoseini, A., Tucker, G., Wang, J., & Wei, W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.06639 · Cited by 34
Automated quantum programming via reinforcement learning for combinatorial optimizationPreprint
McKiernan, K. A., Davis, E., Alam, M. S., & Rigetti, C. T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.08054 · Cited by 33
A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement LearningPreprint
Afshar, R. R., Zhang, Y., Fırat, M., & Kaymak, U. (2020) · TU/e Research Portal · doi:10.48550/arxiv.2004.12117 · Cited by 33
Combinatorial Optimisation Of Worm Propagationon An Unknown Network
Filiol, É., Franc, E., Gubbioli, A., Moquet, B., & Roblot, G. (2007) · doi:10.5281/zenodo.1335271 · Cited by 31
A Three-dimensional Bin Packing AlgorithmPreprint
Scheithauer, G. (1991) · Cited by 28
Gu, S., & Yue, Y. (2020) · Mathematics · doi:10.3390/math8020298 · Cited by 28
Improved bin completion for optimal bin packing and number partitioning
Schreiber, E. L., & Korf, R. E. (2013) · Cited by 23
Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems
Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y., & Balaprakash, P. (2019) · arXiv · doi:10.48550/arxiv.1911.04574 · Cited by 21
Reinforcement learning enhanced quantum-inspired algorithm for combinatorial optimization
Beloborodov, D., Ulanov, A. E., Foerster, J., Whiteson, S., & Lvovsky, A. I. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abc328 · Cited by 18
Co-training for Policy LearningPreprint
Song, J., Lanka, R., Yue, Y., & Ono, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.04484 · Cited by 13
Experimental Comparison of Two Evolutionary Algorithms for the Independent Set Problem
Borisovsky, P., & Zavolovskaya, M. S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36605-9_15 · Cited by 10
Vine copula structure learning via Monte Carlo tree search
Chang, B., Pan, S., & Joe, H. (2019) · International Conference on Artificial Intelligence and Statistics · Cited by 9
Cited by
Reinforcement learning algorithms: A brief survey
Shakya, A. K., Pillai, G., & Chakrabarty, S. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120495 · Cited by 656
Sowmya, R., Premkumar, M., & Jangir, P. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2023.107532 · Cited by 500
Deep Learning for Solving Loading, Packing, Routing, and Scheduling Problems
Elkefi, S., & Layeb, S. B. (2023) · Handbook of Formal Optimization · doi:10.1007/978-981-19-8851-6_16-1 · Cited by 3
Metadata
- Authors
- Mazyavkina, N., Sviridov, S., Ivanov, S., & Burnaev, E.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2021-10
- Volume
- 134
- Pages
- 105400
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W3009304813
- Cited by
- 723
- References
- 113
- FWCI
- 40.76
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.