{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T04:18:17Z","timestamp":1751948297528,"version":"3.41.2"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":["U23A20388","62021001"],"award-info":[{"award-number":["U23A20388","62021001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tpami.2025.3562286","type":"journal-article","created":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T17:39:01Z","timestamp":1745257141000},"page":"6660-6672","source":"Crossref","is-referenced-by-count":0,"title":["Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning"],"prefix":"10.1109","volume":"47","author":[{"given":"Yufei","family":"Kuang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9013-1180","authenticated-orcid":false,"given":"Xijun","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9902-5723","authenticated-orcid":false,"given":"Jie","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Fangzhou","family":"Zhu","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shatin, Hong Kong"}]},{"given":"Meng","family":"Lu","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shatin, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3296-0721","authenticated-orcid":false,"given":"Zhihai","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Jia","family":"Zeng","sequence":"additional","affiliation":[{"name":"Huawei Noah's Ark Lab, Shatin, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2188-3028","authenticated-orcid":false,"given":"Houqiang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1151-1792","authenticated-orcid":false,"given":"Yongdong","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7266-5579","authenticated-orcid":false,"given":"Feng","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580428"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0257-9"},{"key":"ref3","first-page":"20243","article-title":"Practical large-scale linear programming using primal-dual hybrid gradient","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 34: Annu. Conf. Neural Inf. Process. Syst.","author":"Applegate"},{"article-title":"Computational experience with linear optimization and related problems","year":"2010","author":"Elble","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.814"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/isie.1992.279577"},{"article-title":"Coin-or\/clp: Release releases\/1.17.7","year":"2022","author":"Forrest","key":"ref7"},{"year":"2022","key":"ref8","article-title":"Gurobi optimizer reference manual"},{"year":"2022","key":"ref9","article-title":"Optverse solver"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586000"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-003-0130-x"},{"key":"ref12","first-page":"3293","article-title":"Learning to search in branch and bound algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 27: Annu. Conf. Neural Inf. Process. Syst.","author":"He"},{"key":"ref13","first-page":"15554","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 32: Annu. Conf. Neural Inf. Process. Syst.","author":"Gasse"},{"key":"ref14","first-page":"9367","article-title":"Reinforcement learning for integer programming: Learning to cut","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Tang"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.11.024"},{"issue":"189","key":"ref16","first-page":"1","article-title":"Learning to optimize: A primer and a benchmark","volume":"23","author":"Chen","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GCCE.2013.6664844"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.12794\/metadc1505267"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10080"},{"article-title":"Lookback for learning to branch","year":"2022","author":"Gupta","key":"ref21"},{"key":"ref22","first-page":"24235","article-title":"Learning to schedule heuristics in branch and bound","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chmiela"},{"article-title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Wang","key":"ref23"},{"article-title":"A deep reinforcement learning framework for column generation","year":"2022","author":"Chi","key":"ref24"},{"key":"ref25","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 28: Annu. Conf. Neural Inf. Process. Syst.","author":"Vinyals"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0487-2"},{"volume-title":"Reinforcement Learning: An Introduction","year":"2018","author":"Sutton","key":"ref27"},{"key":"ref28","first-page":"13504","article-title":"Promoting stochasticity for expressive policies via a simple and efficient regularization method","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 33: Annu. Conf. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1108\/02635571011044713"},{"article-title":"Deep symbolic regression: Recovering mathematical expressions from data via policy gradients","year":"2019","author":"Petersen","key":"ref30"},{"article-title":"Presolve, crash and software engineering for highs","year":"2023","author":"Galabova","key":"ref31"},{"key":"ref32","first-page":"32000","article-title":"Learning to compare nodes in branch and bound with graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Labassi","year":"2022"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813658","volume-title":"Probability With Martingales, Ser. Cambridge Mathematical Textbooks","author":"Williams","year":"1991"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481925"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/isie.1992.279577"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.12.013"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90261-S"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0120886"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0348"},{"volume-title":"Convex Optimization","year":"2014","author":"Boyd","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8917-8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-020-00129-6"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539391"},{"article-title":"On representing linear programs by graph neural networks","year":"2022","author":"Chen","key":"ref44"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.36.5.519"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1045\/september95-browne"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3"},{"key":"ref48","first-page":"9650","article-title":"Smart initial basis selection for linear programs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Fan"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11068886\/10971949.pdf?arnumber=10971949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T22:57:23Z","timestamp":1751929043000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10971949\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":48,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3562286","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}