{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:31:31Z","timestamp":1774557091122,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"35","license":[{"start":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T00:00:00Z","timestamp":1726617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T00:00:00Z","timestamp":1726617600000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00521-024-10352-6","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T09:02:54Z","timestamp":1726736574000},"page":"22265-22275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Designing dataless neural networks for kidney exchange variants"],"prefix":"10.1007","volume":"36","author":[{"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":[[2024,9,18]]},"reference":[{"key":"10352_CR1","doi-asserted-by":"crossref","unstructured":"Abraham DJ, Blum A, Sandholm T (2007) Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM conference on Electronic commerce, pp 295\u2013304","DOI":"10.1145\/1250910.1250954"},{"key":"10352_CR2","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":"10352_CR3","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.neunet.2022.08.008","volume":"155","author":"R Alkhouri Ismail","year":"2022","unstructured":"Alkhouri Ismail R, Atia George K, Alvaro V (2022) A differentiable approach to the maximum independent set problem using dataless neural networks. Neural Netw 155:168\u2013176","journal-title":"Neural Netw"},{"key":"10352_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2013.05.008","volume":"91","author":"I Ashlagi","year":"2015","unstructured":"Ashlagi I, Fischer F, Kash IA, Procaccia AD (2015) Mix and match: a strategyproof mechanism for multi-hospital kidney exchange. Games Econom Behav 91:284\u2013296","journal-title":"Games Econom Behav"},{"key":"10352_CR5","doi-asserted-by":"crossref","unstructured":"Ashlagi I, Gamarnik D, Rees MA, Roth AE (2012) The need for (long) chains in kidney exchange. Technical report, National Bureau of Economic Research","DOI":"10.3386\/w18202"},{"issue":"3","key":"10352_CR6","doi-asserted-by":"publisher","first-page":"817","DOI":"10.3982\/TE1357","volume":"9","author":"I Ashlagi","year":"2014","unstructured":"Ashlagi I, Roth AE (2014) Free riding and participation in large scale, multi-hospital kidney exchange. Theor Econ 9(3):817\u2013863","journal-title":"Theor Econ"},{"key":"10352_CR7","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"A Giorgio","year":"2012","unstructured":"Giorgio A, Pierluigi C, Giorgio G, Viggo K, Alberto M-S, Marco P (2012) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Cham"},{"issue":"2","key":"10352_CR8","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\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"key":"10352_CR9","unstructured":"Blum A (2013) Algorithms: recitation notes. https:\/\/www.cs.cmu.edu\/avrim\/451f13\/recitation\/rec1016.txt"},{"issue":"2","key":"10352_CR10","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":"10352_CR11","doi-asserted-by":"crossref","unstructured":"Jena SK, Subramani K, Velasquez A (2023) Differentiable discrete optimization using dataless neural networks. In: Weili W, Jianxiong G, (eds.), Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II, vol 14462 of Lecture Notes in Computer Science, pp 3\u201315. Springer","DOI":"10.1007\/978-3-031-49614-1_1"},{"issue":"2","key":"10352_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G Cornuejols","year":"1980","unstructured":"Cornuejols G, Pulleyblank W (1980) A matching problem with side conditions. Discret Math 29(2):135\u2013159","journal-title":"Discret Math"},{"key":"10352_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin FV, Kowalik L, Lokshtanov D (2015) D\u00e1niel Marx. In: Michal P, Saket S (eds) Parameterized algorithms. Springer, Cham"},{"key":"10352_CR14","doi-asserted-by":"crossref","unstructured":"Dickerson JP, Manlove DF, Plaut B, Sandholm T, Trimble J (2016) Position-indexed formulations for kidney exchange. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp 25\u201342","DOI":"10.1145\/2940716.2940759"},{"key":"10352_CR15","doi-asserted-by":"crossref","unstructured":"Ding Y, Ge D, He S, Ryan CT (2015) A non-asymptotic approach to analyzing kidney exchange graphs. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp 257\u2013258","DOI":"10.1145\/2764468.2764494"},{"key":"10352_CR16","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 (2020) 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), pp 19\u201324","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"10352_CR17","doi-asserted-by":"crossref","unstructured":"Festa P (2014) 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), pp 1\u201320","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"10352_CR18","volume-title":"Texts in theoretical computer science. An EATCS series","author":"GM Flum J\u00f6rg","year":"2006","unstructured":"Flum J\u00f6rg GM (2006) Parameterized complexity theory. Texts in theoretical computer science. An EATCS series. Springer, Cham"},{"key":"10352_CR19","volume-title":"Texts in theoretical computer science. An EATCS series","author":"FV Fomin","year":"2010","unstructured":"Fomin FV, Kratsch D (2010) Exact exponential algorithms. Texts in theoretical computer science. An EATCS series. Springer, Cham"},{"key":"10352_CR20","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"MR Garey","year":"1991","unstructured":"Garey MR, Johnson DS (1991) Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman Company, San Francisco"},{"key":"10352_CR21","unstructured":"Gaspers S (2010) Exponential time algorithms-structures, measures, and bounds. VDM"},{"key":"10352_CR22","unstructured":"Hartvigsen D (1984) Extensions of matching theory. PhD thesis, Carnegie Mellon University"},{"key":"10352_CR23","doi-asserted-by":"crossref","unstructured":"Hartvigsen D (1999) The square-free 2-factor problem in bipartite graphs. In: International Conference on Integer Programming and Combinatorial Optimization, pp 234\u2013241. Springer","DOI":"10.1007\/3-540-48777-8_18"},{"key":"10352_CR24","doi-asserted-by":"crossref","unstructured":"Jena SK, Subramani K, Velasquez A (2024) A differential approach for several NP-hard optimization problems. In: International Workshop on Combinatorial Image Analysis, pp 68\u201380. Springer","DOI":"10.1007\/978-3-031-63735-3_4"},{"key":"10352_CR25","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), pp 138\u2013150","DOI":"10.1137\/1.9781611974317.12"},{"key":"10352_CR26","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search. In: Advances in neural information processing systems, p 31"},{"key":"10352_CR27","doi-asserted-by":"publisher","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. Comput Oper Res 134:105400","journal-title":"Comput Oper Res"},{"key":"10352_CR28","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, Oxford"},{"issue":"2","key":"10352_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth AE, S\u00f6nmez T, \u00dcnver MU (2004) Kidney exchange. Quart J Econ 119(2):457\u2013488","journal-title":"Quart J Econ"},{"issue":"2","key":"10352_CR30","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth AE, Tayfun S, Utku \u00dcM (2005) Pairwise kidney exchange. J Econ Theor 125(2):151\u2013188","journal-title":"J Econ Theor"},{"issue":"3","key":"10352_CR31","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth AE, S\u00f6nmez T, Utku \u00dcnver M (2007) Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am Econ Rev 97(3):828\u2013851","journal-title":"Am Econ Rev"},{"issue":"2","key":"10352_CR32","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"PS Segundo","year":"2011","unstructured":"Segundo PS, Rodr\u00edguez-Losada D, Jim\u00e9nez A (2011) An exact bit-parallel algorithm for the maximum clique problem. Comput Oper Res 38(2):571\u2013581","journal-title":"Comput Oper Res"},{"issue":"4","key":"10352_CR33","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s42256-022-00468-6","volume":"4","author":"Martin JA Schuetz","year":"2022","unstructured":"Schuetz Martin JA, Kyle Brubaker J, Katzgraber Helmut G (2022) Combinatorial optimization with physics-inspired graph neural networks. Nat Mach Intell 4(4):367\u2013377","journal-title":"Nat Mach Intell"},{"key":"10352_CR34","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.geb.2015.01.001","volume":"91","author":"P Toulis","year":"2015","unstructured":"Toulis P, Parkes DC (2015) Design and analysis of multi-hospital kidney exchange mechanisms using random graphs. Games Econom Behav 91:360\u2013382","journal-title":"Games Econom Behav"},{"key":"10352_CR35","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"TT William","year":"1954","unstructured":"William TT (1954) A short proof of the factor theorem for finite graphs. Can J Math 6:347\u2013352","journal-title":"Can J Math"},{"key":"10352_CR36","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, vol 33, pp 1658\u20131665","DOI":"10.1609\/aaai.v33i01.33011658"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10352-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-10352-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10352-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T12:06:25Z","timestamp":1732536385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-10352-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,18]]},"references-count":36,"journal-issue":{"issue":"35","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10352"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-10352-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,18]]},"assertion":[{"value":"10 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2024","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"}}]}}