{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:24:16Z","timestamp":1766485456018,"version":"3.37.3"},"reference-count":24,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["603C017"],"award-info":[{"award-number":["603C017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Songjiang Lab"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["INFOR: Information Systems and Operational Research"],"published-print":{"date-parts":[[2024,11,4]]},"DOI":"10.1080\/03155986.2024.2376446","type":"journal-article","created":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T12:51:37Z","timestamp":1723207897000},"page":"588-598","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["A multi-agent learning framework for mixed-integer linear programming"],"prefix":"10.1080","volume":"62","author":[{"given":"Yuchen","family":"Jing","sequence":"first","affiliation":[{"name":"Faculty of Computing, Harbin Institute of Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binyan","family":"Liang","sequence":"additional","affiliation":[{"name":"China Academy of Launch Vehicle Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7965-598X","authenticated-orcid":false,"given":"Siyuan","family":"Li","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Harbin Institute of Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifan","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Harbin Institute of Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Harbin Institute of Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Harbin Institute of Technology, Harbin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,8,9]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"e_1_3_3_3_1","volume-title":"Introduction to linear optimization","author":"Bertsimas D","year":"1997","unstructured":"Bertsimas D, Tsitsiklis JN. 1997. Introduction to linear optimization. Vol. 6. Belmont (MA): Athena Scientific."},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)46716-4"},{"key":"e_1_3_3_5_1","unstructured":"Cao Z Xu Y Huang Z Zhou S. 2022. Ml4co-kida: knowledge inheritance in dataset aggregation. arXiv preprint arXiv:220110328."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01977-x"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2"},{"key":"e_1_3_3_8_1","first-page":"15580","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume":"32","author":"Gasse M","year":"2019","unstructured":"Gasse M, Ch\u00e9telat D, Ferroni N, Charlin L, Lodi A. 2019. Exact combinatorial optimization with graph convolutional neural networks. Adv Neural Inform Process Syst. 32:15580\u201315592.","journal-title":"Adv Neural Inform Process Syst"},{"key":"e_1_3_3_9_1","volume-title":"An algorithm for the mixed integer problem","author":"Gomory RE.","year":"1960","unstructured":"Gomory RE. 1960. An algorithm for the mixed integer problem. Santa Monica (CA): Rand Corporation."},{"key":"e_1_3_3_10_1","first-page":"27(2):3293-3301","article-title":"Learning to search in branch and bound algorithms","author":"He H","year":"2014","unstructured":"He H, Daume IH, Eisner JM. 2014. Learning to search in branch and bound algorithms. Adv Neural Inform Process Syst. 27(2):3293-3301.","journal-title":"Adv Neural Inform Process Syst"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18500-8_64"},{"key":"e_1_3_3_12_1","first-page":"1531","article-title":"A natural policy gradient","volume":"14","author":"Kakade SM.","year":"2001","unstructured":"Kakade SM. 2001. A natural policy gradient. Adv Neural Inform Process Syst. 14:1531\u20131538.","journal-title":"Adv Neural Inform Process Syst"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"e_1_3_3_14_1","first-page":"659","article-title":"Learning to run heuristics in tree search","author":"Khalil EB","year":"2017","unstructured":"Khalil EB, Dilkina B, Nemhauser GL, Ahmed S, Shao Y. 2017. Learning to run heuristics in tree search. IJCAI. 2017: 659\u2013666.","journal-title":"IJCAI"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_5"},{"issue":"1","key":"e_1_3_3_16_1","first-page":"65","article-title":"Branch-and-cut algorithms for combinatorial optimization problems","volume":"1","author":"Mitchell JE.","year":"2002","unstructured":"Mitchell JE. 2002. Branch-and-cut algorithms for combinatorial optimization problems. Handbk Appl Optim. 1(1):65\u201377.","journal-title":"Handbk Appl Optim"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1045"},{"key":"e_1_3_3_18_1","unstructured":"Nair V Bartunov S Gimeno F Von Glehn I Lichocki P Lobov I O\u2019Donoghue B Sonnerat N Tjandraatmadja C Wang P et\u00a0al. 2020. Solving mixed integer programs using neural networks. arXiv preprint arXiv:201213349."},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119005384"},{"key":"e_1_3_3_20_1","first-page":"17584","volume-title":"International Conference on Machine Learning. PMLR","author":"Paulus MB","year":"2022","unstructured":"Paulus MB, Zarpellon G, Krause A, Charlin L, Maddison C. 2022. Learning to cut by looking ahead: cutting plane selection via imitation learning. In: International Conference on Machine Learning. PMLR; p. 17584\u201317600."},{"key":"e_1_3_3_21_1","unstructured":"Qu Q Li X Zhou Y Zeng J Yuan M Wang J Lv J Liu K Mao K. 2022. An improved reinforcement learning algorithm for learning to branch. arXiv preprint arXiv:220106213."},{"key":"e_1_3_3_22_1","first-page":"9367","volume-title":"International Conference on Machine Learning","author":"Tang Y","year":"2020","unstructured":"Tang Y, Agrawal S, Faenza Y. 2020. Reinforcement learning for integer programming: learning to cut. In: International Conference on Machine Learning. PMLR; p. 9367\u20139376."},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.5802\/ojmo.25"},{"key":"e_1_3_3_24_1","unstructured":"Wang Z Li X Wang J Kuang Y Yuan M Zeng J Zhang Y Wu F. 2023. Learning cut selection for mixed-integer linear programming via hierarchical sequence model. arXiv preprint arXiv:230200244."},{"key":"e_1_3_3_25_1","unstructured":"Wesselmann F Stuhl U. 2012. Implementing cutting plane management and selection techniques [Technical report]. Paderborn (Germany): University of Paderborn."}],"container-title":["INFOR: Information Systems and Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/03155986.2024.2376446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T17:20:46Z","timestamp":1731604846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/03155986.2024.2376446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,9]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11,4]]}},"alternative-id":["10.1080\/03155986.2024.2376446"],"URL":"https:\/\/doi.org\/10.1080\/03155986.2024.2376446","relation":{},"ISSN":["0315-5986","1916-0615"],"issn-type":[{"type":"print","value":"0315-5986"},{"type":"electronic","value":"1916-0615"}],"subject":[],"published":{"date-parts":[[2024,8,9]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tinf20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tinf20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-12-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-10","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}