{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:31:34Z","timestamp":1774557094840,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["HR001123S0001-FP-004"],"award-info":[{"award-number":["HR001123S0001-FP-004"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10878-025-01354-8","type":"journal-article","created":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T17:07:06Z","timestamp":1762103226000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Advancing discrete optimization: novel approaches with dataless neural networks"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3028-429X","authenticated-orcid":false,"given":"Sangram K.","family":"Jena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5821-5117","authenticated-orcid":false,"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvaro","family":"Velasquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,2]]},"reference":[{"key":"1354_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2015.09.023","volume":"609","author":"T Akiba","year":"2016","unstructured":"Akiba T, Iwata Y (2016) Branch-and-reduce exponential\/fpt algorithms in practice: a case study of vertex cover. Theoret Comput Sci 609:211\u2013225","journal-title":"Theoret Comput Sci"},{"key":"1354_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.neunet.2022.08.008","volume":"155","author":"IR Alkhouri","year":"2022","unstructured":"Alkhouri IR, Atia GK, Velasquez A (2022) A differentiable approach to the maximum independent set problem using dataless neural networks. Neural Netw 155:168\u2013176","journal-title":"Neural Netw"},{"issue":"2","key":"1354_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1354_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R Boppana","year":"1992","unstructured":"Boppana R, Halld\u00f3rsson MM (1992) Approximating maximum independent sets by excluding subgraphs. BIT Numer Math 32(2):180\u2013196","journal-title":"BIT Numer Math"},{"key":"1354_CR5","doi-asserted-by":"crossref","unstructured":"Drori I, Kharkar A, Sickinger WR, Kates B, Ma Q, Ge S, Dolev E, Dietrich B, Williamson DP, Udell M. Learning to solve combinatorial optimization problems on real-world graphs in linear time. In 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA), pages 19\u201324, 2020","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"1354_CR6","doi-asserted-by":"crossref","unstructured":"Festa P. A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems. In 2014 16th International Conference on Transparent Optical Networks (ICTON), pages 1\u201320, (2014)","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"1354_CR7","doi-asserted-by":"crossref","unstructured":"Jena SK, Subramani K, Velasquez A. Differentiable discrete optimization using dataless neural networks. In International Conference on Combinatorial Optimization and Applications, pages 3\u201315. Springer, (2023)","DOI":"10.1007\/978-3-031-49614-1_1"},{"issue":"35","key":"1354_CR8","doi-asserted-by":"publisher","first-page":"22265","DOI":"10.1007\/s00521-024-10352-6","volume":"36","author":"SK Jena","year":"2024","unstructured":"Jena SK, Subramani K, Velasquez A (2024) Designing dataless neural networks for kidney exchange variants. Neural Comput Appl 36(35):22265\u201322275","journal-title":"Neural Comput Appl"},{"key":"1354_CR9","doi-asserted-by":"crossref","unstructured":"Jena SK, Wojciechowski P (2024) Representation of dominating set variants using dataless neural networks. In International Conference on Algorithmic Aspects in Information and Management, pages 15\u201326. Springer,","DOI":"10.1007\/978-981-97-7801-0_2"},{"key":"1354_CR10","doi-asserted-by":"crossref","unstructured":"Jena SK, Subramani K, Velasquez A (2024) A differential approach for several NP-hard optimization problems. In Reneta\u00a0P. Barneva, Valentin\u00a0E. Brimkov, Claudio Gentile, and Aldo Pacchiano, editors, Artificial Intelligence and Image Analysis - 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8-10, 2024, Revised Selected Papers, volume 14494 of Lecture Notes in Computer Science, pages 68\u201380. Springer,","DOI":"10.1007\/978-3-031-63735-3_4"},{"key":"1354_CR11","doi-asserted-by":"crossref","unstructured":"Lamm S, Sanders P, Schulz C, Strash D, Werneck RF (2016) Finding near-optimal independent sets at scale. In 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 138\u2013150,","DOI":"10.1137\/1.9781611974317.12"},{"key":"1354_CR12","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search. Advances in neural information processing systems, 31,"},{"key":"1354_CR13","doi-asserted-by":"publisher","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina N, Sviridov S, Ivanov S, Burnaev E (2021) Reinforcement learning for combinatorial optimization: a survey. Computers & Operations Res 134:105400","journal-title":"Computers & Operations Res"},{"issue":"2","key":"1354_CR14","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo P, Rodr\u00edguez-Losada D, Jim\u00e9nez A (2011) An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Res 38(2):571\u2013581","journal-title":"Computers & Operations Res"},{"issue":"4","key":"1354_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s42256-022-00468-6","volume":"4","author":"MJA Schuetz","year":"2022","unstructured":"Schuetz MJA, Brubaker JK, Katzgraber HG (2022) Combinatorial optimization with physics-inspired graph neural networks. Nat Mach Intell 4(4):367\u2013377","journal-title":"Nat Mach Intell"},{"key":"1354_CR16","doi-asserted-by":"crossref","unstructured":"Wilder B, Dilkina B, Tambe M (2019) Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. In Proceedings of the AAAI Conference on Artificial Intelligence 33:1658\u20131665","DOI":"10.1609\/aaai.v33i01.33011658"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01354-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01354-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01354-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T15:03:13Z","timestamp":1767193393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01354-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1354"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01354-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"11 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"39"}}