{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T13:47:40Z","timestamp":1780667260288,"version":"3.54.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972286"],"award-info":[{"award-number":["61972286"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tmc.2023.3258974","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T18:06:42Z","timestamp":1679335602000},"page":"2456-2469","source":"Crossref","is-referenced-by-count":5,"title":["Learn to Optimize the Constrained Shortest Path on Large Dynamic Graphs"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6896-8284","authenticated-orcid":false,"given":"Jiaming","family":"Yin","sequence":"first","affiliation":[{"name":"Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6644-0349","authenticated-orcid":false,"given":"Weixiong","family":"Rao","sequence":"additional","affiliation":[{"name":"Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1765-1171","authenticated-orcid":false,"given":"Qinpei","family":"Zhao","sequence":"additional","affiliation":[{"name":"Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1336-9451","authenticated-orcid":false,"given":"Chenxi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0848-2599","authenticated-orcid":false,"given":"Pan","family":"Hui","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, System and Media Laboratory (SyMLab), Hong Kong University of Science and Technology, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Solving NP-hard problems on graphs by reinforcement learning without domain knowledge","author":"Abe","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17450"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2020.01.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58580-8_28"},{"key":"ref5","first-page":"1","article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bello"},{"key":"ref6","first-page":"1","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bruna"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3184-5_1"},{"key":"ref9","first-page":"3837","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-45"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.193"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops50388.2021.9473555"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11757"},{"key":"ref16","article-title":"Solving a new 3D bin packing problem with deep reinforcement learning method","author":"Hu","year":"2017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90020-5"},{"key":"ref19","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Khalil"},{"key":"ref20","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref21","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref22","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Kool"},{"key":"ref23","first-page":"537","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref24","article-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning","author":"Ma","year":"2019"},{"key":"ref25","article-title":"GCOMB: Learning budget-constrained combinatorial algorithms over billion-sized graphs","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst.","author":"Manchanda"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342080"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.03.031"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_23"},{"key":"ref29","article-title":"Playing Atari with deep reinforcement learning","author":"Mnih","year":"2013"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.037"},{"key":"ref31","first-page":"9861","article-title":"Reinforcement learning for solving the vehicle routing problem","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Nazari"},{"key":"ref32","article-title":"A deep q-network for the beer game with partial information","author":"Oroojlooyjadid","year":"2017"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_32"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.05.007"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/net.20212"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.21105\/joss.01655"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.12.001"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.05.109"},{"key":"ref39","article-title":"Constrained combinatorial optimization with reinforcement learning","author":"Solozabal","year":"2020"},{"key":"ref40","volume-title":"Reinforcement Learning, second edition: An Introduction","author":"Sutton","year":"2018"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.03.017"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.27"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2166"},{"key":"ref45","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Vinyals"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.2296515"},{"key":"ref47","first-page":"1995","article-title":"Dueling network architectures for deep reinforcement learning","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/MDM52706.2021.00040"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7755\/10422841\/10076920.pdf?arnumber=10076920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T19:05:55Z","timestamp":1707937555000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10076920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":48,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2023.3258974","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}