{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:06:55Z","timestamp":1755907615515,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,2,2]]},"DOI":"10.1145\/3651671.3651739","type":"proceedings-article","created":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T18:55:50Z","timestamp":1717786550000},"page":"635-641","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Presolver Selection for Mixed-Integer Linear Programming"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2425-4063","authenticated-orcid":false,"given":"Wentao","family":"Song","sequence":"first","affiliation":[{"name":"School of Data Science, University of Science and Technology of China, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8898-0896","authenticated-orcid":false,"given":"Naijie","family":"Gu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, China"}]}],"member":"320","published-online":{"date-parts":[[2024,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Tobias Achterberg. 2007. Constraint integer programming. (2007)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0857"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0400-z"},{"volume-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","author":"Balas Egon","key":"e_1_3_2_1_4_1","unstructured":"Egon Balas and Andrew Ho. 1980. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Springer."},{"key":"e_1_3_2_1_5_1","volume-title":"Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940","author":"Bello Irwan","year":"2016","unstructured":"Irwan Bello, Hieu Pham, Quoc\u00a0V Le, Mohammad Norouzi, and Samy Bengio. 2016. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)."},{"volume-title":"Decision diagrams for optimization. Vol.\u00a01","author":"Bergman David","key":"e_1_3_2_1_6_1","unstructured":"David Bergman, Andre\u00a0A Cire, Willem-Jan Van\u00a0Hoeve, and John Hooker. 2016. Decision diagrams for optimization. Vol.\u00a01. Springer."},{"key":"e_1_3_2_1_7_1","volume-title":"Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical programming 8","author":"Brearley AL","year":"1975","unstructured":"AL Brearley, Gautam Mitra, and H\u00a0Paul Williams. 1975. Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical programming 8 (1975), 54\u201383."},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient presolving methods for solving maximal covering and partial set covering location problems. European Journal of Operational Research","author":"Chen Liang","year":"2023","unstructured":"Liang Chen, Sheng-Jie Chen, Wei-Kun Chen, Yu-Hong Dai, Tao Quan, and Juan Chen. 2023. Efficient presolving methods for solving maximal covering and partial set covering location problems. European Journal of Operational Research (2023)."},{"key":"e_1_3_2_1_9_1","unstructured":"Zhenan Fan Xinglu Wang Oleksandr Yakovenko Abdullah\u00a0Ali Sivas Owen Ren Yong Zhang and Zirui Zhou. 2023. Smart Initial Basis Selection for Linear Programs. (2023)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-020-00129-6"},{"key":"e_1_3_2_1_12_1","volume-title":"PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support. INFORMS Journal on Computing","author":"Gleixner Ambros","year":"2023","unstructured":"Ambros Gleixner, Leona Gottwald, and Alexander Hoen. 2023. PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support. INFORMS Journal on Computing (2023)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68155-7_27"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.1.49"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18500-8_64"},{"key":"e_1_3_2_1_16_1","volume-title":"Long short-term memory. Neural computation 9, 8","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735\u20131780."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.2.121"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(80)90053-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42432-3_37"},{"key":"e_1_3_2_1_20_1","volume-title":"Asynchronous Methods for Deep Reinforcement Learning. arXiv: Learning,arXiv: Learning (Feb","author":"Mnih Volodymyr","year":"2016","unstructured":"Volodymyr Mnih, Adri\u00e0Puigdom\u00e8nech Badia, Mehdi Mirza, Alex Graves, TimothyP. Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. 2016. Asynchronous Methods for Deep Reinforcement Learning. arXiv: Learning,arXiv: Learning (Feb 2016)."},{"key":"e_1_3_2_1_21_1","volume-title":"Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349","author":"Nair Vinod","year":"2020","unstructured":"Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid Von\u00a0Glehn, Pawel Lichocki, Ivan Lobov, Brendan O\u2019Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, 2020. Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349 (2020)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.4.445"},{"volume-title":"Learning primal heuristics for mixed integer programs. In 2021 international joint conference on neural networks (ijcnn)","author":"Shen Yunzhuang","key":"e_1_3_2_1_23_1","unstructured":"Yunzhuang Shen, Yuan Sun, Andrew Eberhard, and Xiaodong Li. 2021. Learning primal heuristics for mixed integer programs. In 2021 international joint conference on neural networks (ijcnn). IEEE, 1\u20138."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v21i1.1501"},{"key":"e_1_3_2_1_25_1","volume-title":"Adaptive cut selection in mixed-integer linear programming. arXiv preprint arXiv:2202.10962","author":"Turner Mark","year":"2022","unstructured":"Mark Turner, Thorsten Koch, Felipe Serrano, and Michael Winkler. 2022. Adaptive cut selection in mixed-integer linear programming. arXiv preprint arXiv:2202.10962 (2022)."},{"key":"e_1_3_2_1_26_1","volume-title":"Pointer networks. Advances in neural information processing systems 28","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer networks. Advances in neural information processing systems 28 (2015)."},{"key":"e_1_3_2_1_27_1","volume-title":"Learning to Branch in Combinatorial Optimization with Graph Pointer Networks. arXiv preprint arXiv:2307.01434","author":"Wang Rui","year":"2023","unstructured":"Rui Wang, Zhiming Zhou, Tao Zhang, Ling Wang, Xin Xu, Xiangke Liao, and Kaiwen Li. 2023. Learning to Branch in Combinatorial Optimization with Graph Pointer Networks. arXiv preprint arXiv:2307.01434 (2023)."},{"key":"e_1_3_2_1_28_1","volume-title":"International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Zob4P9bRNcK","author":"Wang Zhihai","year":"2023","unstructured":"Zhihai Wang, Xijun Li, Jie Wang, Yufei Kuang, Mingxuan Yuan, Jia Zeng, Yongdong Zhang, and Feng Wu. 2023. Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Zob4P9bRNcK"},{"key":"e_1_3_2_1_29_1","volume-title":"Learning efficient search approximation in mixed integer branch and bound. arXiv preprint arXiv:2007.03948","author":"Yilmaz Kaan","year":"2020","unstructured":"Kaan Yilmaz and Neil Yorke-Smith. 2020. Learning efficient search approximation in mixed integer branch and bound. arXiv preprint arXiv:2007.03948 (2020)."}],"event":{"name":"ICMLC 2024: 2024 16th International Conference on Machine Learning and Computing","acronym":"ICMLC 2024","location":"Shenzhen China"},"container-title":["Proceedings of the 2024 16th International Conference on Machine Learning and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651671.3651739","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3651671.3651739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:18:19Z","timestamp":1755861499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651671.3651739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,2]]},"references-count":29,"alternative-id":["10.1145\/3651671.3651739","10.1145\/3651671"],"URL":"https:\/\/doi.org\/10.1145\/3651671.3651739","relation":{},"subject":[],"published":{"date-parts":[[2024,2,2]]},"assertion":[{"value":"2024-06-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}