{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T13:08:07Z","timestamp":1772629687426,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332708","type":"print"},{"value":"9783031332715","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33271-5_2","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Objective-Based Counterfactual Explanations for\u00a0Linear Discrete Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-4487-9504","authenticated-orcid":false,"given":"Anton","family":"Korikov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4656-8908","authenticated-orcid":false,"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bodur, M., Chan, T.C., Zhu, I.Y.: Inverse mixed integer optimization: Polyhedral insights and trust region methods. INFORMS J. Comput. (2022)","DOI":"10.1287\/ijoc.2021.1138"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Brandao, M., Coles, A., Magazzeni, D.: Explaining path plan optimality: fast explanation methods for navigation meshes using full and incremental inverse optimization. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 31, pp. 56\u201364 (2021)","DOI":"10.1609\/icaps.v31i1.15947"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Chakraborti, T., Sreedharan, S., Kambhampati, S.: The emerging landscape of explainable automated planning & decision making. In: IJCAI, pp. 4803\u20134811 (2020)","DOI":"10.24963\/ijcai.2020\/669"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborti, T., Sreedharan, S., Zhang, Y., Kambhampati, S.: Plan explanations as model reconciliation: moving beyond explanation as soliloquy. In: IJCAI (2017)","DOI":"10.24963\/ijcai.2017\/23"},{"key":"2_CR5","unstructured":"Chan, T.C., Mahmood, R., Zhu, I.Y.: Inverse optimization: theory and applications. arXiv preprint arXiv:2109.03920 (2021)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Demange, M., Monnot, J.: An introduction to inverse combinatorial problems. In: Paradigms of Combinatorial Optimization: Problems and New Approaches, pp. 547\u2013586 (2014)","DOI":"10.1002\/9781119005353.ch17"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Doshi-Velez, F., Kortz, M.: Accountability of AI under the law: the role of explanation. Technical report, Berkman Klein Center Working Group on Explanation and the Law, Berkman Klein Center for Internet and Society (2017)","DOI":"10.2139\/ssrn.3064761"},{"key":"2_CR8","unstructured":"Doshi-Velez, F., Kim, B.: Towards a rigorous science of interpretable machine learning. arXiv preprint arXiv:1702.08608 (2017)"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10898-010-9637-2","volume":"51","author":"Z Duan","year":"2011","unstructured":"Duan, Z., Wang, L.: Heuristic algorithms for the inverse mixed integer linear programming problem. J. Global Optim. 51(3), 463\u2013471 (2011)","journal-title":"J. Global Optim."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Eiffer, R., Cashmore, M., Hoffmann, J., Magazzeni, D., Steinmetz, M.: A new approach to plan-space explanation: analyzing plan-property dependencies in oversubscription planning. In: AAAI (2020)","DOI":"10.1609\/aaai.v34i06.6534"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1177\/1088868308316091","volume":"12","author":"K Epstude","year":"2008","unstructured":"Epstude, K., Roese, N.J.: The functional theory of counterfactual thinking. Pers. Soc. Psychol. Rev. 12(2), 168\u2013192 (2008)","journal-title":"Pers. Soc. Psychol. Rev."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Freuder, E.: Explaining ourselves: human-aware constraint reasoning. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.11147"},{"key":"2_CR13","unstructured":"Kim, B., Wattenberg, M., Gilmer, J., Cai, C., Wexler, J., Viegas, F., et al.: Interpretability beyond feature attribution: quantitative testing with concept activation vectors (TCAV). In: International Conference on Machine Learning, pp. 2668\u20132677. PMLR (2018)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Korikov, A., Shleyfman, A., Beck, J.C.: Counterfactual explanations for optimization-based decisions in the context of the GDPR. In: International Joint Conferences on Artificial Intelligence (IJCAI) (2021)","DOI":"10.24963\/ijcai.2021\/564"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Korikov, A., Beck, J.C.: Counterfactual explanations via inverse constraint programming. In: Michel, L.D. (ed.) 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 210, pp. 35:1\u201335:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2021.35. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/15326","DOI":"10.4230\/LIPIcs.CP.2021.35"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Kan, A.R., Brucker, P.: Complexity of machine scheduling problems. In: Annals of Discrete Mathematics, vol. 1, pp. 343\u2013362. Elsevier (1977)","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.07.007","volume":"267","author":"T Miller","year":"2019","unstructured":"Miller, T.: Explanation in artificial intelligence: insights from the social sciences. Artif. Intell. 267, 1\u201338 (2019)","journal-title":"Artif. Intell."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 607\u2013617 (2020)","DOI":"10.1145\/3351095.3372850"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Kellerer, H., Pferschy, U.: Knapsack problems. In: Handbook of Combinatorial Optimization, p. 299 (2013)","DOI":"10.1007\/978-1-4613-0303-9_5"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Senthooran, I., et al.: Human-centred feasibility restoration. In: Michel, L.D. (ed.) 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 210, pp. 49:1\u201349:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2021.49. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/15340","DOI":"10.4230\/LIPIcs.CP.2021.49"},{"key":"2_CR21","unstructured":"Smith, D.E.: Planning as an iterative process. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 10\u201319 (2019)","DOI":"10.1145\/3287560.3287566"},{"key":"2_CR23","unstructured":"Verma, S., Dickerson, J., Hines, K.: Counterfactual explanations for machine learning: a review. In: NeurIPS Workshop on ML Retrospectives, Surveys and Meta-Analyses (2020)"},{"key":"2_CR24","first-page":"841","volume":"31","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the GDPR. Harv. JL & Tech. 31, 841 (2017)","journal-title":"Harv. JL & Tech."},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.orl.2008.12.001","volume":"37","author":"L Wang","year":"2009","unstructured":"Wang, L.: Cutting plane algorithms for the inverse mixed integer linear programming problem. Oper. Res. Lett. 37(2), 114\u2013116 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10898-013-0036-3","volume":"55","author":"L Wang","year":"2013","unstructured":"Wang, L.: Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem. J. Global Optim. 55(3), 491\u2013506 (2013)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:28Z","timestamp":1684775008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}