{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T17:55:41Z","timestamp":1791482141297,"version":"4.3.4"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031080104","type":"print"},{"value":"9783031080111","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_14","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"190-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":91,"title":["Deep Policy Dynamic Programming for\u00a0Vehicle Routing Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1837-1454","authenticated-orcid":false,"given":"Wouter","family":"Kool","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1583-3692","authenticated-orcid":false,"given":"Herke","family":"van Hoof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1467-6656","authenticated-orcid":false,"given":"Joaquim","family":"Gromicho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1484-2121","authenticated-orcid":false,"given":"Max","family":"Welling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1287\/trsc.2021.1059","volume":"55","author":"L Accorsi","year":"2021","unstructured":"Accorsi, L., Vigo, D.: A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems. Transp. Sci. 55(4), 832\u2013856 (2021)","journal-title":"Transp. Sci."},{"key":"14_CR2","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde TSP Solver (2006). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde"},{"key":"14_CR3","unstructured":"Bai, R., et al.: Analytics and machine learning in vehicle routing research. arXiv preprint arXiv:2102.10012 (2021)"},{"issue":"8","key":"14_CR4","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1073\/pnas.38.8.716","volume":"38","author":"R Bellman","year":"1952","unstructured":"Bellman, R.: On the theory of dynamic programming. Proc. Natl. Acad. Sci. U.S.A. 38(8), 716 (1952)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61\u201363 (1962)","journal-title":"J. ACM (JACM)"},{"key":"14_CR6","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"14_CR7","unstructured":"Bertsekas, D.: Dynamic Programming and Optimal Control, vol. 1. Athena Scientific (2017)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Moisan, T., Rousseau, L.M., Pr\u00e9mont-Schwarz, I., Cire, A.: Combining reinforcement learning and constraint programming for combinatorial optimization. In: AAAI Conference on Artificial Intelligence (AAAI) (2021)","DOI":"10.1609\/aaai.v35i5.16484"},{"key":"14_CR9","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 6281\u20136292 (2019)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W Cook","year":"2003","unstructured":"Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(3), 233\u2013248 (2003)","journal-title":"INFORMS J. Comput."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"da Costa, P.R.d.O., Rhuggenaath, J., Zhang, Y., Akcay, A.: Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In: Asian Conference on Machine Learning (ACML) (2020)","DOI":"10.1007\/s42979-021-00779-2"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","volume":"7","author":"RF Da Silva","year":"2010","unstructured":"Da Silva, R.F., Urrutia, S.: A general VNS heuristic for the traveling salesman problem with time windows. Discret. Optim. 7(4), 203\u2013211 (2010)","journal-title":"Discret. Optim."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Daum\u00e9, H., III., Marcu, D.: Learning as search optimization: approximate large margin methods for structured prediction. In: International Conference on Machine Learning (ICML), pp. 169\u2013176 (2005)","DOI":"10.1145\/1102351.1102373"},{"key":"14_CR14","unstructured":"Delarue, A., Anderson, R., Tjandraatmadja, C.: Reinforcement learning with combinatorial actions: an application to vehicle routing. In: Advances in Neural Information Processing Systems (NeurIPS), vol. 33 (2020)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-93031-2_12","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Deudon","year":"2018","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.-M.: Learning heuristics for the TSP by policy gradient. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 170\u2013181. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_12"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43(2), 367\u2013371 (1995)","journal-title":"Oper. Res."},{"key":"14_CR18","unstructured":"Falkner, J.K., Schmidt-Thieme, L.: Learning to solve vehicle routing problems with time windows through joint attention. arXiv preprint arXiv:2006.09100 (2020)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Fu, Z.H., Qiu, K.B., Zha, H.: Generalize a small pre-trained model to arbitrarily large tsp instances. In: AAAI Conference on Artificial Intelligence (AAAI) (2021)","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"14_CR20","unstructured":"Gao, L., Chen, M., Chen, Q., Luo, G., Zhu, N., Liu, Z.: Learn to design the heuristics for vehicle routing problem. In: International Workshop on Heuristic Search in Industry (HSI) at the International Joint Conference on Artificial Intelligence (IJCAI) (2020)"},{"key":"14_CR21","unstructured":"Gasse, M., Chetelat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2019)"},{"issue":"5","key":"14_CR22","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1016\/j.cor.2011.07.002","volume":"39","author":"J Gromicho","year":"2012","unstructured":"Gromicho, J., van Hoorn, J.J., Kok, A.L., Schutten, J.M.: Restricted dynamic programming: a flexible framework for solving realistic VRPs. Comput. Oper. Res. 39(5), 902\u2013909 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"14_CR23","doi-asserted-by":"publisher","first-page":"2968","DOI":"10.1016\/j.cor.2012.02.024","volume":"39","author":"JA Gromicho","year":"2012","unstructured":"Gromicho, J.A., Van Hoorn, J.J., Saldanha-da Gama, F., Timmer, G.T.: Solving the job-shop scheduling problem optimally by dynamic programming. Comput. Oper. Res. 39(12), 2968\u20132977 (2012)","journal-title":"Comput. Oper. Res."},{"key":"14_CR24","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2021). https:\/\/www.gurobi.com"},{"key":"14_CR25","unstructured":"van Heeswijk, W., La Poutr\u00e9, H.: Approximate dynamic programming with neural networks in linear discrete action spaces. arXiv preprint arXiv:1902.09855 (2019)"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"14_CR27","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems: Technical report (2017)"},{"key":"14_CR28","unstructured":"van Hoorn, J.J.: Dynamic programming for routing and scheduling. Ph.D. thesis (2016)"},{"key":"14_CR29","unstructured":"Hottung, A., Bhandari, B., Tierney, K.: Learning a latent search space for routing problems using variational autoencoders. In: International Conference on Learning Representations (ICML) (2021)"},{"key":"14_CR30","unstructured":"Hottung, A., Tierney, K.: Neural large neighborhood search for the capacitated vehicle routing problem. In: European Conference on Artificial Intelligence (ECAI) (2020)"},{"key":"14_CR31","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning (ICML), pp. 448\u2013456 (2015)"},{"key":"14_CR32","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem. In: INFORMS Annual Meeting (2019)"},{"key":"14_CR33","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: On learning paradigms for the travelling salesman problem. In: Graph Representation Learning Workshop at Neural Information Processing Systems (NeurIPS) (2019)"},{"key":"14_CR34","unstructured":"Kim, M., Park, J., Kim, J.: Learning collaborative policies to solve NP-hard routing problems. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)"},{"issue":"1\u20132","key":"14_CR35","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10696-011-9077-4","volume":"22","author":"A Kok","year":"2010","unstructured":"Kok, A., Hans, E.W., Schutten, J.M., Zijm, W.H.: A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks. Flex. Serv. Manuf. J. 22(1\u20132), 83\u2013108 (2010)","journal-title":"Flex. Serv. Manuf. J."},{"key":"14_CR36","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (ICLR) (2019)"},{"key":"14_CR37","unstructured":"Kwon, Y.D., Choo, J., Kim, B., Yoon, I., Gwon, Y., Min, S.: Pomo: policy optimization with multiple optima for reinforcement learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)"},{"issue":"3","key":"14_CR38","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. (EJOR) 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res. (EJOR)"},{"issue":"7553","key":"14_CR39","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436\u2013444 (2015)","journal-title":"Nature"},{"key":"14_CR40","unstructured":"Lee, J., Lee, Y., Kim, J., Kosiorek, A., Choi, S., Teh, Y.W.: Set transformer: a framework for attention-based permutation-invariant neural networks. In: International Conference on Machine Learning (ICML), pp. 3744\u20133753. PMLR (2019)"},{"key":"14_CR41","unstructured":"Li, S., Yan, Z., Wu, C.: Learning to delegate for large-scale vehicle routing. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"14_CR42","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. In: Advances in Neural Information Processing Systems (NeurIPS), p. 539 (2018)"},{"key":"14_CR43","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (2020)"},{"key":"14_CR44","unstructured":"Ma, Q., Ge, S., He, D., Thaker, D., Drori, I.: Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. In: AAAI International Workshop on Deep Learning on Graphs: Methodologies and Applications (DLGMA) (2020)"},{"key":"14_CR45","unstructured":"Ma, Y., et al.: Learning to iteratively solve routing problems with dual-aspect collaborative transformer. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)"},{"issue":"1","key":"14_CR46","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C Malandraki","year":"1996","unstructured":"Malandraki, C., Dial, R.B.: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur. J. Oper. Res. (EJOR) 90(1), 45\u201355 (1996)","journal-title":"Eur. J. Oper. Res. (EJOR)"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. arXiv preprint arXiv:2003.03600 (2020)","DOI":"10.1016\/j.cor.2021.105400"},{"issue":"3","key":"14_CR48","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/opre.45.3.365","volume":"45","author":"A Mingozzi","year":"1997","unstructured":"Mingozzi, A., Bianco, L., Ricciardelli, S.: Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints. Oper. Res. 45(3), 365\u2013377 (1997)","journal-title":"Oper. Res."},{"key":"14_CR49","unstructured":"Nair, V., et al.: Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349 (2020)"},{"key":"14_CR50","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L., Takac, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 9860\u20139870 (2018)"},{"issue":"2","key":"14_CR51","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2008.03.023","volume":"196","author":"C Novoa","year":"2009","unstructured":"Novoa, C., Storer, R.: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. (EJOR) 196(2), 509\u2013515 (2009)","journal-title":"Eur. J. Oper. Res. (EJOR)"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"Nowak, A., Villar, S., Bandeira, A.S., Bruna, J.: A note on learning algorithms for quadratic assignment with graph neural networks. In: Principled Approaches to Deep Learning Workshop at the International Conference on Machine Learning (ICML) (2017)","DOI":"10.1109\/DSW.2018.8439919"},{"key":"14_CR53","unstructured":"Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems (NeurIPS), vol. 32, pp. 8026\u20138037 (2019)"},{"key":"14_CR54","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-981-15-5577-0_51","volume-title":"Artificial Intelligence Algorithms and Applications","author":"B Peng","year":"2020","unstructured":"Peng, B., Wang, J., Zhang, Z.: A deep reinforcement learning algorithm using dynamic attention model for vehicle routing problems. In: Li, K., Li, W., Wang, H., Liu, Y. (eds.) ISICA 2019. CCIS, vol. 1205, pp. 636\u2013650. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-5577-0_51"},{"issue":"4","key":"14_CR55","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"2","key":"14_CR56","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139\u2013171 (2000)","journal-title":"J. Comput. Phys."},{"issue":"6419","key":"14_CR57","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D., et al.: A general reinforcement learning algorithm that masters chess, shogi, and go through self-play. Science 362(6419), 1140\u20131144 (2018)","journal-title":"Science"},{"issue":"3","key":"14_CR58","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00291-020-00604-x","volume":"43","author":"Y Sun","year":"2020","unstructured":"Sun, Y., Ernst, A., Li, X., Weiner, J.: Generalization of machine learning for problem reduction: a case study on travelling salesman problems. OR Spectr. 43(3), 607\u2013633 (2020). https:\/\/doi.org\/10.1007\/s00291-020-00604-x","journal-title":"OR Spectr."},{"key":"14_CR59","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)","DOI":"10.1137\/1.9781611973594"},{"issue":"3","key":"14_CR60","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. (EJOR) 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res. (EJOR)"},{"key":"14_CR61","doi-asserted-by":"publisher","first-page":"120388","DOI":"10.1109\/ACCESS.2020.3004964","volume":"8","author":"N Vesselinova","year":"2020","unstructured":"Vesselinova, N., Steinert, R., Perez-Ramirez, D.F., Boman, M.: Learning combinatorial optimization on graphs: a survey with applications to networking. IEEE Access 8, 120388\u2013120416 (2020)","journal-title":"IEEE Access"},{"key":"14_CR62","unstructured":"Vidal, T.: Hybrid genetic search for the CVRP: open-source implementation and swap* neighborhood. arXiv preprint arXiv:2012.10384 (2020)"},{"issue":"3","key":"14_CR63","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"key":"14_CR64","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 2692\u20132700 (2015)"},{"key":"14_CR65","doi-asserted-by":"crossref","unstructured":"Wiseman, S., Rush, A.M.: Sequence-to-sequence learning as beam-search optimization. In: Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1296\u20131306 (2016)","DOI":"10.18653\/v1\/D16-1137"},{"key":"14_CR66","doi-asserted-by":"crossref","unstructured":"Wu, Y., Song, W., Cao, Z., Zhang, J., Lim, A.: Learning improvement heuristics for solving routing problems. IEEE Trans. Neural Netw. Learn. Syst. (2021)","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"14_CR67","doi-asserted-by":"crossref","unstructured":"Xin, L., Song, W., Cao, Z., Zhang, J.: Step-wise deep learning models for solving routing problems. IEEE Trans. Ind. Inform. (2020)","DOI":"10.1109\/TII.2020.3031409"},{"key":"14_CR68","unstructured":"Xin, L., Song, W., Cao, Z., Zhang, J.: NeuroLKH: combining deep learning model with Lin-Kernighan-Helsgaun heuristic for solving the traveling salesman problem. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"14_CR69","doi-asserted-by":"crossref","unstructured":"Xu, S., Panwar, S.S., Kodialam, M., Lakshman, T.: Deep neural network approximated dynamic programming for combinatorial optimization. In: AAAI Conference on Artificial Intelligence (AAAI), vol. 34, pp. 1684\u20131691 (2020)","DOI":"10.1609\/aaai.v34i02.5531"},{"key":"14_CR70","unstructured":"Yang, F., Jin, T., Liu, T.Y., Sun, X., Zhang, J.: Boosting dynamic programming with neural networks for solving np-hard problems. In: Asian Conference on Machine Learning (ACML), pp. 726\u2013739. PMLR (2018)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:04:55Z","timestamp":1667912695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}