{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:40:09Z","timestamp":1777567209171,"version":"3.51.4"},"reference-count":92,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2022ZD0119801"],"award-info":[{"award-number":["2022ZD0119801"]}]},{"name":"National Nature Science Foundations of China","award":["U19B2026"],"award-info":[{"award-number":["U19B2026"]}]},{"name":"National Nature Science Foundations of China","award":["U19B2044"],"award-info":[{"award-number":["U19B2044"]}]},{"name":"National Nature Science Foundations of China","award":["61836011"],"award-info":[{"award-number":["61836011"]}]},{"name":"National Nature Science Foundations of China","award":["62021001"],"award-info":[{"award-number":["62021001"]}]},{"name":"National Nature Science Foundations of China","award":["61836006"],"award-info":[{"award-number":["61836006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tpami.2024.3432716","type":"journal-article","created":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T19:24:14Z","timestamp":1721762654000},"page":"9697-9713","source":"Crossref","is-referenced-by-count":5,"title":["Learning to Cut via Hierarchical Sequence\/Set Model for Efficient Mixed-Integer Programming"],"prefix":"10.1109","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9902-5723","authenticated-orcid":false,"given":"Jie","family":"Wang","sequence":"first","affiliation":[{"name":"MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3296-0721","authenticated-orcid":false,"given":"Zhihai","family":"Wang","sequence":"additional","affiliation":[{"name":"MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9013-1180","authenticated-orcid":false,"given":"Xijun","family":"Li","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Kuang","sequence":"additional","affiliation":[{"name":"MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7869-7798","authenticated-orcid":false,"given":"Zhihao","family":"Shi","sequence":"additional","affiliation":[{"name":"MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangzhou","family":"Zhu","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2236-8784","authenticated-orcid":false,"given":"Mingxuan","family":"Yuan","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Zeng","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1151-1792","authenticated-orcid":false,"given":"Yongdong","family":"Zhang","sequence":"additional","affiliation":[{"name":"MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7266-5579","authenticated-orcid":false,"given":"Feng","family":"Wu","sequence":"additional","affiliation":[{"name":"MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8917-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/9781119005384"},{"key":"ref4","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","author":"J\u00fcnger","year":"2009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0688"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0301"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"Farahani","year":"2009"},{"key":"ref8","article-title":"Solving mixed integer programs using neural networks","author":"Nair","year":"2020"},{"key":"ref9","article-title":"Gurobi solver","year":"2021"},{"key":"ref10","article-title":"The scip optimization suite 8.0","author":"Bestuzheva","year":"2021"},{"key":"ref11","article-title":"Xpress optimization suite","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_5"},{"key":"ref13","article-title":"An algorithm for the mixed integer problem","volume-title":"The Rand Corporation, Santa Monica, CA","author":"Gomory","year":"1960"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5802\/ojmo.25"},{"key":"ref16","first-page":"17584","article-title":"Learning to cut by looking ahead: Cutting plane selection via imitation learning","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Paulus"},{"key":"ref17","article-title":"Implementing cutting plane management and selection techniques","author":"Wesselmann","year":"2012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1302-4"},{"key":"ref19","first-page":"9367","article-title":"Reinforcement learning for integer programming: Learning to cut","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Tang"},{"key":"ref20","volume-title":"Production Planning by Mixed Integer Programming","volume":"149","author":"Pochet","year":"2006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108353"},{"key":"ref22","article-title":"Order matters: Sequence to sequence for sets","volume-title":"Proc. 4th Int. Conf. Learn. Representations","author":"Vinyals"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3"},{"key":"ref24","article-title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-017-0451-6"},{"key":"ref26","article-title":"Machine learning for combinatorial optimization","author":"Bowly","year":"2021"},{"key":"ref27","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gasse"},{"key":"ref28","article-title":"Ecole: A gym-like library for machine learning in combinatorial optimization solvers","author":"Prouvost","year":"2020"},{"key":"ref29","article-title":"Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks","author":"Baltean-Lugojan","year":"2019"},{"key":"ref30","first-page":"724","article-title":"Learning to branch in mixed integer programming","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Khalil"},{"key":"ref31","first-page":"344","article-title":"Learning to branch","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Balcan"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16512"},{"key":"ref33","first-page":"3293","article-title":"Learning to search in branch and bound algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"He"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29828-8_23"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1045"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/92"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18500-8_64"},{"key":"ref38","first-page":"4015","article-title":"Sample complexity of tree search configuration: Cutting planes and beyond","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Balcan"},{"key":"ref39","article-title":"Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts","author":"Balcan","year":"2022"},{"issue":"1","key":"ref40","first-page":"65","article-title":"Branch-and-cut algorithms for combinatorial optimization problems","volume":"1","author":"Mitchell","year":"2002","journal-title":"Handbook Appl. Optim."},{"key":"ref41","article-title":"ML4CO-KIDA: Knowledge inheritance in dataset aggregation","author":"Cao","year":"2022"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.3.267"},{"key":"ref43","volume-title":"Computational Techniques of the Simplex Method","volume":"61","author":"Maros","year":"2002"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/educ.2013.0112"},{"key":"ref45","article-title":"Learning to reformulate for linear programming","author":"Li","year":"2022"},{"key":"ref46","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref47","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref48","first-page":"1861","article-title":"Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Haarnoja"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref50","volume-title":"Deep Learning","author":"Goodfellow","year":"2016"},{"key":"ref51","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sutskever"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref53","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vinyals"},{"key":"ref54","article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proc. 5th Int. Conf. Learn Representations Workshop Track","author":"Bello*","year":"2017"},{"key":"ref55","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sutton"},{"key":"ref56","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Mnih"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1810.04805"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2010.11929"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00986"},{"key":"ref60","first-page":"1117","article-title":"VIME: Variational information maximizing exploration","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Houthooft"},{"key":"ref61","article-title":"Exploration by random network distillation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Burda"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26224"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00052-1"},{"key":"ref64","first-page":"3307","article-title":"Data-efficient hierarchical reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nachum"},{"key":"ref65","article-title":"Evolution strategies as a scalable alternative to reinforcement learning","author":"Salimans","year":"2017"},{"key":"ref66","first-page":"1889","article-title":"Trust region policy optimization","volume-title":"Proc. 32nd Int. Conf. Mach. Learn.","author":"Schulman"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2012.10.003"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(85)90041-0"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/BF01782758"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120886"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9"},{"key":"ref72","article-title":"Learning to branch with tree MDPs","author":"Scavuzzo","year":"2022"},{"key":"ref73","article-title":"Improving learning to branch via reinforcement learning","volume-title":"Proc. Learn. Meets Combinatorial Algorithms","author":"Sun"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0400-z"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68155-7_27"},{"key":"ref76","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455008"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-2233-5"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.10.4.427"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050067"},{"key":"ref81","article-title":"Lookback for learning to branch","author":"Gupta","year":"2022"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"ref83","first-page":"1587","article-title":"Addressing function approximation error in actor-critic methods","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Fujimoto"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1137\/s0363012901385691"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref86","article-title":"Randomized ensembled double Q-learning: Learning fast without a model","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref87","article-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016"},{"key":"ref88","volume-title":"Foundations of Machine Learning","author":"Mohri","year":"2018"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1049-9_1"},{"issue":"2","key":"ref90","first-page":"159","article-title":"The Gurobi optimizer","volume":"41","author":"Bixby","year":"2007","journal-title":"Transp. Res. Part B"},{"key":"ref91","first-page":"16","article-title":"Solving mixed-integerquadratic programming problems with IBM-CPLEX: A progress report","volume-title":"Proc. 26th RAMP Symp.","author":"Bliek1\u00fa"},{"key":"ref92","article-title":"Optverse AI solver","year":"2021"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10746266\/10607926.pdf?arnumber=10607926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:07Z","timestamp":1732665607000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10607926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":92,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3432716","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}