{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T10:07:15Z","timestamp":1780654035545,"version":"3.54.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091918","type":"print"},{"value":"9783032091925","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09192-5_3","type":"book-chapter","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:24:58Z","timestamp":1767309898000},"page":"31-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to\u00a0Repair Infeasible$$^*$$ Problems with\u00a0Deep Reinforcement Learning on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"M.","family":"Zouitine","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Berjaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Lagnoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Rachelson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"3_CR1","first-page":"181","volume":"147","author":"E Amaldi","year":"1994","unstructured":"Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Oper. Res. 147, 181\u2013210 (1994)","journal-title":"Oper. Res."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Amaldi, E.: From finding maximum feasible subsystems of linear systems to feedforward neural network design, PhD dissertation, Swiss Federal Institute of Technology at Lausanne (EPFL) (1994)","DOI":"10.1007\/3-540-57785-8_168"},{"key":"3_CR3","unstructured":"Audemard, G., Simon, L.: Glucose: a solver that predicts learnt clauses quality. In: SAT Competition, pp.\u00a07\u20138 (2009)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Practical Aspects of Declarative Languages: 7th International Symposium, PADL 2005, Long Beach, CA, USA, January 10\u201311, 2005. Proceedings 7, pp. 174\u2013186. Springer (2005)","DOI":"10.1007\/978-3-540-30557-6_14"},{"key":"3_CR5","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2017)"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/ijoc.9.3.311","volume":"9","author":"KP Bennett","year":"1997","unstructured":"Bennett, K.P., Bredensteiner, E.J.: A parametric optimization method for machine learning. INFORMS J. Comput. 9(3), 311\u2013318 (1997)","journal-title":"INFORMS J. Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B Borchers","year":"1998","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for max-sat and weighted max-sat problems. J. Comb. Optim. 2, 299\u2013306 (1998)","journal-title":"J. Comb. Optim."},{"key":"3_CR8","unstructured":"Chen, Z., Liu, J., Wang, X., Lu, J., Yin, W.: On representing linear programs by graph neural networks. arXiv preprint arXiv:2209.12288 (2022)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02284627","volume":"17","author":"JW Chinneck","year":"1996","unstructured":"Chinneck, J.W.: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem. Ann. Math. Artif. Intell. 17(1), 127\u2013144 (1996)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/ijoc.13.3.210.12632","volume":"13","author":"JW Chinneck","year":"2001","unstructured":"Chinneck, J.W.: Fast heuristics for the maximum feasible subsystem problem. INFORMS J. Comput. 13(3), 210\u2013223 (2001)","journal-title":"INFORMS J. Comput."},{"key":"3_CR11","unstructured":"Chinneck, J.W.: Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods, vol.\u00a0118. Springer Science & Business Media (2007)"},{"key":"3_CR12","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with PyTorch Geometric. In: ICLR Workshop on Representation Learning on Graphs and Manifolds (2019)"},{"key":"3_CR13","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Gibbons, D., Lim, C.C., Shi, P.: Deep learning for bipartite assignment problems. In: 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 2318\u20132325 (2019). https:\/\/doi.org\/10.1109\/SMC.2019.8914228","DOI":"10.1109\/SMC.2019.8914228"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018)","journal-title":"Math. Program. Comput."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 428\u2013437. Springer (2018)","DOI":"10.1007\/978-3-319-94144-8_26"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/SAT190116","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: RC2: an efficient MaxSAT solver. J. Satisfiability Boolean Model. Comput. 11(1), 53\u201364 (2019)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Joshi, C.K., Cappart, Q., Rousseau, L.M., Laurent, T.: Learning the travelling salesperson problem requires rethinking generalization (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2021.33","DOI":"10.4230\/LIPIcs.CP.2021.33"},{"key":"3_CR19","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"3_CR20","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2019)"},{"issue":"1","key":"3_CR21","first-page":"32","volume":"13","author":"V Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for constraint-satisfaction problems: a survey. AI Mag. 13(1), 32\u201332 (1992)","journal-title":"AI Mag."},{"key":"3_CR22","unstructured":"Kwiatkowski, A., et al.: Gymnasium: a standard interface for reinforcement learning environments. arXiv preprint arXiv:2407.17032 (2024)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reason. 40, 1\u201333 (2008)","journal-title":"J. Autom. Reason."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Liu, M., et al.: Can graph neural networks learn to solve the MaxSAT problem? (Student abstract). In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a037, pp. 16264\u201316265 (2023)","DOI":"10.1609\/aaai.v37i13.26992"},{"key":"3_CR25","unstructured":"Lynce, I., Marques-Silva, J.P.: On computing minimum unsatisfiable cores (2004)"},{"issue":"4","key":"3_CR26","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01096681","volume":"5","author":"OL Mangasarian","year":"1994","unstructured":"Mangasarian, O.L.: Misclassification minimization. J. Global Optim. 5(4), 309\u2013323 (1994)","journal-title":"J. Global Optim."},{"key":"3_CR27","unstructured":"Parker, M.R.: A set covering approach to infeasibility analysis of linear programming problems and related issues, Ph.D. thesis, University of Colorado at Denver Denver, Colorado (1995)"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/050645828","volume":"19","author":"ME Pfetsch","year":"2008","unstructured":"Pfetsch, M.E.: Branch-and-cut for the maximum feasible subsystem problem. SIAM J. Optim. 19(1), 21\u201338 (2008)","journal-title":"SIAM J. Optim."},{"key":"3_CR29","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley (2014)"},{"key":"3_CR30","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"3_CR31","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press (2018)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"T\u00f6nshoff, J., Kisin, B., Lindner, J., Grohe, M.: One model, any CSP: graph neural networks as fast global search heuristics for constraint satisfaction. arXiv preprint arXiv:2208.10227 (2022)","DOI":"10.24963\/ijcai.2023\/476"},{"key":"3_CR33","unstructured":"Vaswani, A., et al.: Attention is all you need. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"key":"3_CR34","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer Networks. arXiv preprint arXiv:1506.03134 (2017)"},{"issue":"3","key":"3_CR35","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P., et al.: SciPY 1.0: fundamental algorithms for scientific computing in Python. Nat. Methods 17(3), 261\u2013272 (2020)","journal-title":"Nat. Methods"},{"issue":"1\u20132","key":"3_CR36","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z Xing","year":"2005","unstructured":"Xing, Z., Zhang, W.: MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artif. Intell. 164(1\u20132), 47\u201380 (2005)","journal-title":"Artif. Intell."},{"key":"3_CR37","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Chi, X.: Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 1621\u20131632 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Zouitine, M., Berjaoui, A., Lagnoux, A., Pellegrini, C., Rachelson, E.: Learning heuristics for combinatorial optimization problems on k-partite hypergraphs. In: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 304\u2013314. Springer (2024)","DOI":"10.1007\/978-3-031-60599-4_21"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09192-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T09:24:46Z","timestamp":1780651486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09192-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032091918","9783032091925"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09192-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion19.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}