{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T19:21:57Z","timestamp":1779909717524,"version":"3.53.1"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T00:00:00Z","timestamp":1661040000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T00:00:00Z","timestamp":1661040000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8,21]]},"DOI":"10.1109\/icpr56361.2022.9956256","type":"proceedings-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T19:34:13Z","timestamp":1669750453000},"page":"3105-3111","source":"Crossref","is-referenced-by-count":15,"title":["Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch"],"prefix":"10.1109","author":[{"given":"Tianyu","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Alberta,Edmonton,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Banitalebi-Dehkordi","sequence":"additional","affiliation":[{"name":"Huawei Technologies Canada Co., Ltd.,Vancouver,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies Canada Co., Ltd.,Vancouver,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Ml4co: Is gcnn all you need? graph convolutional neural networks produce strong baselines for combinatorial optimization problems, if tuned and trained properly, on appropriate data","author":"banitalebi-dehkordi","year":"2021"},{"key":"ref38","article-title":"Ml4co-kida: Knowledge inheritance in dataset aggregation","author":"cao","year":"2022"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90261-S"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352879"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120886"},{"key":"ref30","article-title":"Solving np-hard problems on graphs with extended alphago zero","author":"abe","year":"2019","journal-title":"arXiv preprint arXiv 1905 11167"},{"key":"ref37","year":"0","journal-title":"ML4CO 2021 neurips competition on machine learning for combinatorial optimization"},{"key":"ref36","article-title":"Ecole: A gym-like library for machine learning in combinatorial optimization solvers","author":"prouvost","year":"2020","journal-title":"Learning Meets Combinatorial Algorithms at NeurIPS2020"},{"key":"ref35","author":"gamrath","year":"2020","journal-title":"The SCIP optimization suite 7 0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3"},{"key":"ref12","article-title":"Exact combinatorial optimization with graph convolutional neural networks","author":"gasse","year":"2019"},{"key":"ref13","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"2016","journal-title":"arXiv preprint arXiv 1611 09940"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref15","article-title":"Proximal policy optimization algorithms","author":"schulman","year":"2017","journal-title":"arXiv preprint arXiv 1707 06347"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.173"},{"key":"ref17","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref18","first-page":"2006","article-title":"Branch and bound methods","author":"boyd","year":"2007","journal-title":"Notes for EE364b Stanford University"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.04.002"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"ref27","article-title":"A learning-based iterative method for solving vehicle routing problems","author":"lu","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/08927029708024151"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1504\/IJMOR.2010.032718"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011443"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006529012972"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00388-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.03.013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584074"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0723"},{"key":"ref21","article-title":"The traveling salesman problem: A computational study","author":"lenstra","year":"2009"},{"key":"ref24","article-title":"Cuts, primal heuristics, and learning to branch for the time-dependent traveling salesman problem","author":"hansknecht","year":"2018","journal-title":"arXiv preprint arXiv 1805 01415"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"ref26","first-page":"2702","article-title":"Discriminative embeddings of latent variable models for structured data","author":"dai","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref25","article-title":"Learning combinatorial optimization algorithms over graphs","author":"dai","year":"2017","journal-title":"arXiv preprint arXiv 1704 01665"}],"event":{"name":"2022 26th International Conference on Pattern Recognition (ICPR)","location":"Montreal, QC, Canada","start":{"date-parts":[[2022,8,21]]},"end":{"date-parts":[[2022,8,25]]}},"container-title":["2022 26th International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9956007\/9955631\/09956256.pdf?arnumber=9956256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:05:50Z","timestamp":1671480350000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9956256\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,21]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/icpr56361.2022.9956256","relation":{},"subject":[],"published":{"date-parts":[[2022,8,21]]}}}