{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:31:38Z","timestamp":1774557098450,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031637346","type":"print"},{"value":"9783031637353","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63735-3_4","type":"book-chapter","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:02:07Z","timestamp":1721682127000},"page":"68-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Differential Approach for\u00a0Several NP-hard Optimization Problems"],"prefix":"10.1007","author":[{"given":"Sangram K.","family":"Jena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"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,7,23]]},"reference":[{"key":"4_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.: Branch-and-reduce exponential\/fpt algorithms in practice: a case study of vertex cover. Theoret. Comput. Sci. 609, 211\u2013225 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"4_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, I.R., Atia, G.K., Velasquez, A.: A differentiable approach to the maximum independent set problem using dataless neural networks. Neural Netw. 155, 168\u2013176 (2022)","journal-title":"Neural Netw."},{"issue":"2","key":"4_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.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R Boppana","year":"1992","unstructured":"Boppana, R., Halld\u00f3rsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT Numer. Math. 32(2), 180\u2013196 (1992)","journal-title":"BIT Numer. Math."},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Drori, I., et al.: Learning to solve combinatorial optimization problems on real-world graphs in linear time. In: IEEE International Conference on Machine Learning and Applications, pp. 19\u201324 (2020)","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Festa, P.: A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems. In: International Conference on Transparent Optical Networks, pp. 1\u201320 (2014)","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. In: Texts in Theoretical Computer Science. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kratsch, D.: Exact exponential algorithms. In: Texts in Theoretical Computer Science. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7","DOI":"10.1007\/978-3-642-16533-7"},{"key":"4_CR10","unstructured":"Gaspers, S.: Exponential Time Algorithms - Structures, Measures, and Bounds. VDM (2010)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Jena, S.K., Subramani, K., Velasquez, A.: Differentiable discrete optimization using dataless neural networks. In: International Conference on Combinatorial Optimization and Applications, pp. 3\u201315 (2023)","DOI":"10.1007\/978-3-031-49614-1_1"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Finding near-optimal independent sets at scale. In: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, pp. 138\u2013150 (2016)","DOI":"10.1137\/1.9781611974317.12"},{"key":"4_CR13","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"4_CR14","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.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","journal-title":"Comput. Oper. Res."},{"key":"4_CR15","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.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"4_CR16","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.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s42256-022-00468-6","volume":"4","author":"M Schuetz","year":"2022","unstructured":"Schuetz, M., Brubaker, J., Katzgraber, H.G.: Combinatorial optimization with physics-inspired graph neural networks. Nat. Mach. Intell. 4(4), 367\u2013377 (2022)","journal-title":"Nat. Mach. Intell."},{"key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2002","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63735-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T16:06:40Z","timestamp":1732464400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63735-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637346","9783031637353"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63735-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This research was supported in part by the Defense Advanced Research Projects Agency through grant HR001123S0001-FP-004.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ISAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Artificial Intelligence and Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isaim2024.cs.ou.edu\/iwcia.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}