{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:43:55Z","timestamp":1769273035149,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"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,7,14]]},"DOI":"10.1145\/3638530.3664128","type":"proceedings-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T14:54:43Z","timestamp":1722524083000},"page":"2067-2075","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential Heuristics"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8036-9276","authenticated-orcid":false,"given":"Hongyu","family":"Liu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8594-4045","authenticated-orcid":false,"given":"Haoyang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2483-3638","authenticated-orcid":false,"given":"Yufei","family":"Kuang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2332-3959","authenticated-orcid":false,"given":"Bin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Tobias Achterberg. 2007. Constraint integer programming. (2007)."},{"key":"e_1_3_2_2_2_1","unstructured":"Thomas Baeck David B. Fogel and Zbigniew Michalewicz. 2000. Evolution-ary Computation 1: Basic Algorithms and Operators. https:\/\/api.semanticscholar.org\/CorpusID:59766097"},{"key":"e_1_3_2_2_3_1","volume-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","author":"Balas Egon","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_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584074"},{"key":"e_1_3_2_2_5_1","volume-title":"Integrated production and outbound distribution scheduling: review and extensions. Operations research 58, 1","author":"Chen Zhi-Long","year":"2010","unstructured":"Zhi-Long Chen. 2010. Integrated production and outbound distribution scheduling: review and extensions. Operations research 58, 1 (2010), 130--148."},{"key":"e_1_3_2_2_6_1","volume-title":"A comparison of heuristics and relaxations for the capacitated plant location problem. European journal of operational research 50, 3","author":"Cornu\u00e9jols G\u00e9rard","year":"1991","unstructured":"G\u00e9rard Cornu\u00e9jols, Ranjani Sridharan, and Jean-Michel Thizy. 1991. A comparison of heuristics and relaxations for the capacitated plant location problem. European journal of operational research 50, 3 (1991), 280--297."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/8.3.250"},{"key":"e_1_3_2_2_8_1","volume-title":"Machine learning control by symbolic regression","author":"Diveev Askhat","unstructured":"Askhat Diveev and Elizaveta Shmalko. 2021. Machine learning control by symbolic regression. Springer."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.736"},{"key":"e_1_3_2_2_10_1","volume-title":"Exact combinatorial optimization with graph convolutional neural networks. Advances in neural information processing systems 32","author":"Gasse Maxime","year":"2019","unstructured":"Maxime Gasse, Didier Ch\u00e9telat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi. 2019. Exact combinatorial optimization with graph convolutional neural networks. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_2_2_12_1","volume-title":"Hal Daume III, and Jason M Eisner","author":"He He","year":"2014","unstructured":"He He, Hal Daume III, and Jason M Eisner. 2014. Learning to search in branch and bound algorithms. Advances in neural information processing systems 27 (2014)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0348"},{"key":"e_1_3_2_2_14_1","volume-title":"Integration of neural network-based symbolic regression in deep learning for scientific discovery","author":"Kim Samuel","year":"2020","unstructured":"Samuel Kim, Peter Y Lu, Srijon Mukherjee, Michael Gilbert, Li Jing, Vladimir \u010ceperi\u0107, and Marin Solja\u010di\u0107. 2020. Integration of neural network-based symbolic regression in deep learning for scientific discovery. IEEE transactions on neural networks and learning systems 32, 9 (2020), 4166--4177."},{"key":"e_1_3_2_2_15_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_16_1","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection. https:\/\/api.semanticscholar.org\/CorpusID:31978081","author":"Koza John R.","year":"1992","unstructured":"John R. Koza. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. https:\/\/api.semanticscholar.org\/CorpusID:31978081"},{"key":"e_1_3_2_2_17_1","unstructured":"Yufei Kuang Jie Wang Haoyang Liu Fangzhou Zhu Xijun Li Jia Zeng Jianye HAO Bin Li and Feng Wu. 2024. Rethinking Branching on Exact Combinatorial Optimization Solver: The First Deep Symbolic Discovery Framework. In The Twelfth International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=jKhNBulNMh"},{"key":"e_1_3_2_2_18_1","first-page":"32000","article-title":"Learning to compare nodes in branch and bound with graph neural networks","volume":"35","author":"Labassi Abdel Ghani","year":"2022","unstructured":"Abdel Ghani Labassi, Didier Ch\u00e9telat, and Andrea Lodi. 2022. Learning to compare nodes in branch and bound with graph neural networks. Advances in Neural Information Processing Systems 35 (2022), 32000--32010.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_19_1","volume-title":"International Conference on Machine Learning. PMLR, 5979--5989","author":"Landajuela Mikel","year":"2021","unstructured":"Mikel Landajuela, Brenden K Petersen, Sookyung Kim, Claudio P Santiago, Ruben Glatt, Nathan Mundhenk, Jacob F Pettit, and Daniel Faissol. 2021. Discovering symbolic policies with deep reinforcement learning. In International Conference on Machine Learning. PMLR, 5979--5989."},{"key":"e_1_3_2_2_20_1","volume-title":"Faissol","author":"Landajuela Mikel","year":"2021","unstructured":"Mikel Landajuela, Brenden K. Petersen, Soo K. Kim, Claudio P. Santiago, Ruben Glatt, T. Nathan Mundhenk, Jacob F. Pettit, and Daniel M. Faissol. 2021. Improving exploration in policy gradient search: Application to symbolic optimization. arXiv:2107.09158 [cs.LG]"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1021\/ie800646q"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2019.06.015"},{"key":"e_1_3_2_2_23_1","unstructured":"Gurobi Optimization. 2021. LLC Gurobi Optimizer Reference Manual.(2022)."},{"key":"e_1_3_2_2_24_1","volume-title":"Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, et al. 2019. Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_3_2_2_25_1","volume-title":"Learning to dive in branch and bound. Advances in Neural Information Processing Systems 36","author":"Paulus Max","year":"2024","unstructured":"Max Paulus and Andreas Krause. 2024. Learning to dive in branch and bound. Advances in Neural Information Processing Systems 36 (2024)."},{"key":"e_1_3_2_2_26_1","volume-title":"Scikit-learn: Machine Learn-ing in Python, Journal of Machine Learning Re-search, 12.","author":"Pedregosa Fabian","year":"2011","unstructured":"Fabian Pedregosa, Gael Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al. 2011. Scikit-learn: Machine Learn-ing in Python, Journal of Machine Learning Re-search, 12. (2011)."},{"key":"e_1_3_2_2_27_1","volume-title":"Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients. arXiv preprint arXiv:1912.04871","author":"Petersen Brenden K","year":"2019","unstructured":"Brenden K Petersen, Mikel Landajuela, T Nathan Mundhenk, Claudio P Santiago, Soo K Kim, and Joanne T Kim. 2019. Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients. arXiv preprint arXiv:1912.04871 (2019)."},{"key":"e_1_3_2_2_28_1","unstructured":"Riccardo Poli William B. Langdon and Nicholas Freitag McPhee. 2008. A Field Guide to Genetic Programming. lulu.com. http:\/\/www.gp-field-guide.org.uk\/"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1165893"},{"key":"e_1_3_2_2_30_1","unstructured":"John Schulman Filip Wolski Prafulla Dhariwal Alec Radford and Oleg Klimov. 2017. Proximal Policy Optimization Algorithms. arXiv:1707.06347 [cs.LG]"},{"key":"e_1_3_2_2_31_1","volume-title":"Learning to search via retrospective imitation. arXiv preprint arXiv:1804.00846","author":"Song Jialin","year":"2018","unstructured":"Jialin Song, Ravi Lanka, Albert Zhao, Aadyot Bhatnagar, Yisong Yue, and Masahiro Ono. 2018. Learning to search via retrospective imitation. arXiv preprint arXiv:1804.00846 (2018)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.3390\/ai2020010"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASS58611.2023.00045"}],"event":{"name":"GECCO '24 Companion: Genetic and Evolutionary Computation Conference Companion","location":"Melbourne VIC Australia","acronym":"GECCO '24 Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638530.3664128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:12Z","timestamp":1750291572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3664128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":33,"alternative-id":["10.1145\/3638530.3664128","10.1145\/3638530"],"URL":"https:\/\/doi.org\/10.1145\/3638530.3664128","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}