{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T00:49:23Z","timestamp":1774658963607,"version":"3.50.1"},"reference-count":111,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001729","name":"Swedish Foundation for Strategic Research (SSF) Time Critical Clouds","doi-asserted-by":"publisher","award":["RIT15-0075"],"award-info":[{"award-number":["RIT15-0075"]}],"id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001858","name":"Celtic Plus 5G-PERFECTA","doi-asserted-by":"publisher","award":["2018-00735"],"award-info":[{"award-number":["2018-00735"]}],"id":[{"id":"10.13039\/501100001858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3004964","type":"journal-article","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T20:14:31Z","timestamp":1593116071000},"page":"120388-120416","source":"Crossref","is-referenced-by-count":131,"title":["Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9406-1562","authenticated-orcid":false,"given":"Natalia","family":"Vesselinova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5893-7774","authenticated-orcid":false,"given":"Rebecca","family":"Steinert","sequence":"additional","affiliation":[]},{"given":"Daniel F.","family":"Perez-Ramirez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7949-1815","authenticated-orcid":false,"given":"Magnus","family":"Boman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0069-y"},{"key":"ref33","first-page":"6000","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc 31st Adv Neural Inf Process Syst (NeurIPS)"},{"key":"ref32","first-page":"1","article-title":"Neural machine translation by jointly learning to align and translate","author":"bahdanau","year":"2014","journal-title":"arXiv 1409 0473"},{"key":"ref31","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","author":"sutskever","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3363574"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2000000102"},{"key":"ref27","author":"murphy","year":"2020","journal-title":"Machine Learning A Probabilistic Perspective"},{"key":"ref29","first-page":"1","article-title":"Thirty years of machine learning: The road to Pareto-optimal next-generation wireless networks","author":"wang","year":"2019","journal-title":"arXiv 1902 01946"},{"key":"ref20","article-title":"Learning a sat solver from single-bit supervision","author":"selsam","year":"2019","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref22","first-page":"539","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"li","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","first-page":"9839","article-title":"Reinforcement learning for solving the vehicle routing problem","author":"nazari","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","article-title":"Learning heuristics over large graphs via deep reinforcement learning","author":"mittal","year":"2019","journal-title":"arXiv 1903 03332"},{"key":"ref23","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","author":"dai","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","author":"goodfellow","year":"2016","journal-title":"Deep Learning"},{"key":"ref101","first-page":"14","article-title":"On the complexity of the maximum cut problem","volume":"7","author":"bodlaender","year":"2000","journal-title":"Nordic J Comput"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45612-0_1","article-title":"Meta-heuristics: The state of the art","volume":"2148","author":"vo\u00df","year":"2001","journal-title":"Local Search for Planning and Scheduling"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.02.053"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref51","article-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning","author":"ma","year":"2019","journal-title":"arXiv 1911 04936"},{"key":"ref59","article-title":"Solving NP-hard problems on graphs with extended AlphaGo zero","author":"abe","year":"2019","journal-title":"arXiv 1905 11623"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_32"},{"key":"ref57","first-page":"2702","article-title":"Discriminative embeddings of latent variable models for structured data","author":"dai","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref56","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"joshi","year":"2019","journal-title":"arXiv 1906 01227"},{"key":"ref55","first-page":"1","article-title":"A note on learning algorithms for quadratic assignment with graph neural networks","author":"nowak","year":"2017","journal-title":"Proc ICML Workshop Principled Approaches Deep Learn (PADL)"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"ref53","article-title":"Learning improvement heuristics for solving routing problems","author":"wu","year":"2019","journal-title":"arXiv 1912 05784"},{"key":"ref52","first-page":"1851","article-title":"Latent space policies for hierarchical reinforcement learning","volume":"80","author":"haarnoja","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/772"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.15"},{"key":"ref6","article-title":"Reinforcement learning for combinatorial optimization: A survey","author":"mazyavkina","year":"2020","journal-title":"arXiv 2003 03600"},{"key":"ref5","article-title":"Machine learning for combinatorial optimization: A methodological tour d’Horizon","author":"bengio","year":"2018","journal-title":"arXiv 1811 06128"},{"key":"ref8","first-page":"238","article-title":"Improved parameterized upper bounds for vertex cover","author":"chen","year":"2006","journal-title":"Mathematical Foundations of Computer Science"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref7","author":"papadimitriou","year":"1982","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref46","first-page":"1","article-title":"Playing Atari with deep reinforcement learning","author":"mnih","year":"2013","journal-title":"NIPS Deep Learning Workshop"},{"key":"ref45","article-title":"Learning from delayed rewards","author":"watkins","year":"1989"},{"key":"ref48","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","author":"mnih","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref42","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume":"70","author":"gilmer","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref41","first-page":"1","article-title":"Gated graph sequence neural networks","volume":"abs 1511 5493","author":"li","year":"2015","journal-title":"CoRR"},{"key":"ref44","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref43","first-page":"1","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref73","year":"2014","journal-title":"Gurobi Optimizer Reference Manual"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref71","first-page":"5061","article-title":"SAT competition 2016: Recent developments","author":"balyo","year":"2017","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.04.001"},{"key":"ref76","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erdos","year":"1960","journal-title":"Publ Math Inst Hungar Acad Sci"},{"key":"ref77","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref75","first-page":"157","volume":"46","year":"2009","journal-title":"V12 1 User’s Manual for CPLEX"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/3314148.3314357"},{"key":"ref79","article-title":"Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case","author":"almasan","year":"2019","journal-title":"arXiv 1910 07421"},{"key":"ref60","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1038\/nature24270","article-title":"Mastering the game of go without human knowledge","volume":"550","author":"silver","year":"2017","journal-title":"Nature"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.44"},{"key":"ref61","first-page":"1","article-title":"How powerful are graph neural networks?","author":"xu","year":"2019","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143955"},{"key":"ref64","first-page":"28","article-title":"The sample-complexity of general reinforcement learning","author":"lattimore","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2743240"},{"key":"ref66","year":"2015","journal-title":"OR-Tools - Google Optimization Tools"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9055-x"},{"key":"ref68","author":"leskovec","year":"2020","journal-title":"SNAP Datasets Stanford large network dataset collection"},{"key":"ref2","first-page":"52","article-title":"Representation learning on graphs: Methods and applications","volume":"40","author":"hamilton","year":"2017","journal-title":"Bulletin of the Technical Committee on Data Engineering IEEE"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"ref95","first-page":"81","article-title":"GRAPHENE: Packing and dependency-aware scheduling for data-parallel clusters","author":"grandl","year":"2016","journal-title":"Proc of USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73545-8_9"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/3117811.3117829"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9180-4"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2016.7497206"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/203032"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1145\/3360468.3366773"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2015905954"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/3342280.3342327"},{"key":"ref105","first-page":"141","article-title":"Heuristic algorithm for finding the maximum independent set with absolute estimate of the accuracy","author":"gainanov","year":"2018","journal-title":"Proc CEUR Workshop"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2886259"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.06.001"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-0487-9_83"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2933383"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908489"},{"key":"ref110","first-page":"480","article-title":"Solving MAX-SAT problems using a memetic evolutionary meta-heuristic","volume":"1","author":"boughaci","year":"2004","journal-title":"Proc IEEE Conf Cybern Intell Syst"},{"key":"ref98","first-page":"1","article-title":"Continuous control with deep reinforcement learning","author":"lillicrap","year":"2016","journal-title":"Proc 4th Int Conf Learn Represent (ICLR)"},{"key":"ref99","volume":"12","author":"gutin","year":"2006","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref96","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","volume":"48","author":"mnih","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847928"},{"key":"ref10","first-page":"1","article-title":"Meta-heuristics: The state of the art","author":"vo\u00df","year":"2000","journal-title":"Proc Workshop Local Search Planning Scheduling"},{"key":"ref11","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749"},{"key":"ref13","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"2017","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref15","first-page":"1","article-title":"Attention, learn to solve routing problems!","author":"kool","year":"2019","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref16","author":"applegate","year":"2006","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737456"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2979966"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00125"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2666781"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2008.4605925"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737649"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342080"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2016.7818394"},{"key":"ref86","first-page":"1","article-title":"EdgeSlice: Slicing wireless edge computing network with decentralized deep reinforcement learning","author":"liu","year":"2020","journal-title":"arXiv 2003 12911"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet47604.2019.9064110"},{"key":"ref88","year":"2020","journal-title":"Knowledge-defined networking training datasets"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09125934.pdf?arnumber=9125934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:27Z","timestamp":1642003047000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9125934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":111,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3004964","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}