{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:59:34Z","timestamp":1781387974162,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:00:00Z","timestamp":1717027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:00:00Z","timestamp":1717027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000183","name":"United States Department of Defense | United States Army | U.S. Army Research, Development and Engineering Command | Army Research Office","doi-asserted-by":"publisher","award":["W911NF-21-1-0322"],"award-info":[{"award-number":["W911NF-21-1-0322"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"United States Department of Defense | United States Army | U.S. Army Research, Development and Engineering Command | Army Research Office","doi-asserted-by":"publisher","award":["W911NF-21-1-0322"],"award-info":[{"award-number":["W911NF-21-1-0322"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"United States Department of Defense | United States Army | U.S. Army Research, Development and Engineering Command | Army Research Office","doi-asserted-by":"publisher","award":["W911NF-21-1-0322"],"award-info":[{"award-number":["W911NF-21-1-0322"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"United States Department of Defense | United States Army | U.S. Army Research, Development and Engineering Command | Army Research Office","doi-asserted-by":"publisher","award":["W911NF-21-1-0322"],"award-info":[{"award-number":["W911NF-21-1-0322"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"United States Department of Defense | United States Army | U.S. Army Research, Development and Engineering Command | Army Research Office","doi-asserted-by":"publisher","award":["W911NF-21-1-0322"],"award-info":[{"award-number":["W911NF-21-1-0322"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2112665"],"award-info":[{"award-number":["2112665"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2112665"],"award-info":[{"award-number":["2112665"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["211266"],"award-info":[{"award-number":["211266"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"DOI":"10.1038\/s42256-024-00833-7","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T06:40:26Z","timestamp":1717051226000},"page":"664-672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Distributed constrained combinatorial optimization leveraging hypergraph neural networks"],"prefix":"10.1038","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8097-9885","authenticated-orcid":false,"given":"Nasimeh","family":"Heydaribeni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinrui","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9554-8073","authenticated-orcid":false,"given":"Ruisi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0798-3794","authenticated-orcid":false,"given":"Farinaz","family":"Koushanfar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"833_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-023-06221-2","volume":"620","author":"H Wang","year":"2023","unstructured":"Wang, H. et al. Scientific discovery in the age of artificial intelligence. Nature 620, 47\u201360 (2023).","journal-title":"Nature"},{"key":"833_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s42256-022-00468-6","volume":"4","author":"MJA Schuetz","year":"2022","unstructured":"Schuetz, M. J. A., Brubaker, J. K. & Katzgraber, H. G. Combinatorial optimization with physics-inspired graph neural networks. Nat. Mach. Intell. 4, 367\u2013377 (2022).","journal-title":"Nat. Mach. Intell."},{"key":"833_CR3","first-page":"1","volume":"24","author":"Q Cappart","year":"2023","unstructured":"Cappart, Q. et al. Combinatorial optimization and reasoning with graph neural networks. J. Mach. Learn. Res. 24, 1\u201361 (2023).","journal-title":"J. Mach. Learn. Res."},{"key":"833_CR4","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G. & Dilkina, B. Learning to branch in mixed integer programming. In Proc. 30th AAAI Conference on Artificial Intelligence 724\u2013731 (AAAI, 2016).","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"833_CR5","doi-asserted-by":"crossref","unstructured":"Bai, Y. et al. Simgnn: a neural network approach to fast graph similarity computation. In Proc. 12th ACM International Conference on Web Search and Data Mining 384\u2013392 (ACM, 2019).","DOI":"10.1145\/3289600.3290967"},{"key":"833_CR6","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L. & Lodi, A. Exact combinatorial optimization with graph convolutional neural networks. In Proc. Advances in Neural Information Processing Systems 32 (eds Wallach, H. et al.) 15580\u201315592 (NeurIPS, 2019)."},{"key":"833_CR7","unstructured":"Nair, V. et al. Solving mixed integer programs using neural networks. Preprint at https:\/\/arXiv.org\/2012.13349 (2020)."},{"key":"833_CR8","unstructured":"Li, Z., Chen, Q. & Koltun, V. Combinatorial optimization with graph convolutional networks and guided tree search. In Proc. Advances in Neural Information Processing Systems 31 (eds Bengio, S. et al.) 537\u2013546 (NeurIPS, 2018)."},{"key":"833_CR9","unstructured":"Karalias, N. & Loukas, A. Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs. In Proc. Advances in Neural Information Processing Systems 33 (eds Larochelle, H. et al.) 6659\u20136672 (NeurIPS, 2020)."},{"key":"833_CR10","doi-asserted-by":"publisher","first-page":"580607","DOI":"10.3389\/frai.2020.580607","volume":"3","author":"J Toenshoff","year":"2021","unstructured":"Toenshoff, J., Ritzert, M., Wolf, H. & Grohe, M. Graph neural networks for maximum constraint satisfaction. Front. Artif. Intell. 3, 580607 (2021).","journal-title":"Front. Artif. Intell."},{"key":"833_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/s41586-021-03544-w","volume":"594","author":"A Mirhoseini","year":"2021","unstructured":"Mirhoseini, A. et al. A graph placement methodology for fast chip design. Nature 594, 207\u2013212 (2021).","journal-title":"Nature"},{"key":"833_CR12","unstructured":"Yolcu, E. & P\u00f3czos, B. Learning local search heuristics for boolean satisfiability. In Proc. Advances in Neural Information Processing Systems 32 (eds Wallach, H. et al.) 7992\u20138003 (NeurIPS, 2019)."},{"key":"833_CR13","unstructured":"Ma, Q., Ge, S., He, D., Thaker, D. & Drori, I. Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. Preprint at https:\/\/arXiv.org\/1911.04936 (2019)."},{"key":"833_CR14","unstructured":"Kool, W., Van Hoof, H. & Welling, M. Attention, learn to solve routing problems! In International Conference on Learning Representations (ICLR, 2018)."},{"key":"833_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.3390\/math10020283","volume":"10","author":"M Asghari","year":"2022","unstructured":"Asghari, M., Fathollahi-Fard, A. M., Mirzapour Al-E-Hashem, S. M. J. & Dulebenets, M. A. Transformation and linearization techniques in optimization: a state-of-the-art survey. Mathematics 10, 283 (2022).","journal-title":"Mathematics"},{"key":"833_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-021-04197-2","volume":"22","author":"S Feng","year":"2021","unstructured":"Feng, S. et al. Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC Bioinformatics 22, 1\u201321 (2021).","journal-title":"BMC Bioinformatics"},{"key":"833_CR17","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-24584-w","volume":"12","author":"KA Murgas","year":"2022","unstructured":"Murgas, K. A., Saucan, E. & Sandhu, R. Hypergraph geometry reflects higher-order dynamics in protein interaction networks. Sci. Rep. 12, 20879 (2022).","journal-title":"Sci. Rep."},{"key":"833_CR18","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","volume":"6","author":"J Zhu","year":"2018","unstructured":"Zhu, J., Zhu, J., Ghosh, S., Wu, W. & Yuan, J. Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng. 6, 801\u2013811 (2018).","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"833_CR19","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1007\/s10845-021-01784-1","volume":"33","author":"L Xia","year":"2022","unstructured":"Xia, L., Zheng, P., Huang, X. & Liu, C. A novel hypergraph convolution network-based approach for predicting the material removal rate in chemical mechanical planarization. J. Intell. Manuf. 33, 2295\u20132306 (2022).","journal-title":"J. Intell. Manuf."},{"key":"833_CR20","doi-asserted-by":"crossref","unstructured":"Wen, Y., Gao, Y., Liu, S., Cheng, Q. & Ji, R. Hyperspectral image classification with hypergraph modelling. In Proc. 4th International Conference on Internet Multimedia Computing and Service 34\u201337 (ACM, 2012).","DOI":"10.1145\/2382336.2382346"},{"key":"833_CR21","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R. & Gao, Y. Hypergraph neural networks. In Proc. 33rd AAAI Conference on Artificial Intelligence 3558\u20133565 (AAAI, 2019).","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"833_CR22","doi-asserted-by":"crossref","unstructured":"Angelini, M. C. & Ricci-Tersenghi, F. Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set. Nature Mach. Intell. 5, 29\u201331 (2023).","DOI":"10.1038\/s42256-022-00589-y"},{"key":"833_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr, C. D. & Vecchi, M. P. Optimization by simulated annealing. Science 220, 671\u2013680 (1983).","journal-title":"Science"},{"key":"833_CR24","unstructured":"Kingma, D. P. & Ba, J. Adam: a method for stochastic optimization. Preprint at https:\/\/arXiv.org\/1412.6980 (2014)."},{"key":"833_CR25","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic, U. & Hao, J.-K. Breakout local search for the max-cutproblem. Eng. Appl. Artif. Intell. 26, 1162\u20131173 (2013).","journal-title":"Eng. Appl. Artif. Intell."},{"key":"833_CR26","unstructured":"APS dataset on Physical Review Journals, published by the American Physical Society, https:\/\/journals.aps.org\/datasets (n.d.)"},{"key":"833_CR27","unstructured":"Ye, Y. The gset dataset, https:\/\/web.stanford.edu\/~yyye\/yyye\/Gset (Stanford, 2003)."},{"key":"833_CR28","unstructured":"Hu, W. et al. Open graph benchmark: datasets for machine learning on graphs. In Proc. Advances in Neural Information Processing Systems 33 (eds Larochelle, H. et al.) 22118\u201322133 (2020)."},{"key":"833_CR29","unstructured":"Ndc-substances dataset. Cornell https:\/\/www.cs.cornell.edu\/~arb\/data\/NDC-substances\/ (2018)."},{"key":"833_CR30","doi-asserted-by":"crossref","unstructured":"Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A. & Kleinberg, J. Simplicial closure and higher-order link prediction. Proc. Natl Acad. Sci. USA 115, E11221\u2013E11230 (2018).","DOI":"10.1073\/pnas.1800683115"},{"key":"833_CR31","unstructured":"Hoos, H. H., & St\u00fctzle, T. SATLIB: An online resource for research on SAT. Sat, 2000, 283\u2013292 (2000)."},{"key":"833_CR32","doi-asserted-by":"publisher","unstructured":"Heydaribeni, N., Zhan, X., Zhang, R., Eliassi-Rad, T. & Koushanfar, F. Source code for \u2018Distributed constrained combinatorial optimization leveraging hypergraph neural networks\u2019. Code Ocean https:\/\/doi.org\/10.24433\/CO.4804643.v1 (2024).","DOI":"10.24433\/CO.4804643.v1"}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-024-00833-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-024-00833-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-024-00833-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T17:03:01Z","timestamp":1759856581000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-024-00833-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,30]]},"references-count":32,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["833"],"URL":"https:\/\/doi.org\/10.1038\/s42256-024-00833-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3613917\/v1","asserted-by":"object"}]},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,30]]},"assertion":[{"value":"15 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"N.H., R.Z., T.E.-R. and F.K are listed as inventors on a patent application (serial number 63\/641,601) on distributed constrained combinatorial optimization leveraging HyperGNNs. X.Z. declares no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}