{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:22:18Z","timestamp":1755998538013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031609237"},{"type":"electronic","value":"9783031609244"}],"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-60924-4_24","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:38:27Z","timestamp":1716349107000},"page":"318-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Counterfactual Explanations for\u00a0k-Nearest Neighbors Using Mathematical Optimization and\u00a0Constraint Programming"],"prefix":"10.1007","author":[{"given":"Claudio","family":"Contardo","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Fukasawa","sequence":"additional","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]},{"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"24_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, TU Berlin (2007)"},{"key":"24_CR2","unstructured":"Artelt, A., Hammer, B.: On the computation of counterfactual explanations \u2013 a survey (2019). https:\/\/arxiv.org\/abs\/1911.07749"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"24_CR4","unstructured":"Forel, A., Parmentier, A., Vidal, T.: Explainable data-driven optimization: from context to decision and back again. In: 40th International Conference on Machine Learning (ICML 2023) (2023). https:\/\/publications.polymtl.ca\/56889\/"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Guidotti, R.: Counterfactual explanations and how to find them: literature review and benchmarking. Data Min. Knowl. Discov. 1\u201355 (2022)","DOI":"10.1007\/s10618-022-00831-6"},{"key":"24_CR6","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"key":"24_CR7","unstructured":"Parmentier, A., Vidal, T.: Optimal counterfactual explanations in tree ensembles. In: International Conference on Machine Learning, pp. 8422\u20138431. PMLR (2021)"},{"issue":"Oct","key":"24_CR8","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12(Oct), 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR9","unstructured":"Perron, L., Didier, F.: CP-SAT. https:\/\/developers.google.com\/optimization\/cp\/cp_solver\/"},{"key":"24_CR10","unstructured":"Roland, M., Forel, A., Vidal, T.: Adaptive partitioning for chance-constrained problems with finite support (2023). https:\/\/arxiv.org\/abs\/2312.13180"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Russell, C.: Efficient search for diverse coherent explanations. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 20\u201328 (2019)","DOI":"10.1145\/3287560.3287569"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1137\/140967337","volume":"25","author":"Y Song","year":"2015","unstructured":"Song, Y., Luedtke, J.: An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. SIAM J. Optim. 25(3), 1344\u20131367 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1287\/trsc.2019.0911","volume":"54","author":"DM Vu","year":"2020","unstructured":"Vu, D.M., Hewitt, M., Boland, N., Savelsbergh, M.: Dynamic discretization discovery for solving the time-dependent traveling salesman problem with time windows. Transp. Sci. 54(3), 703\u2013720 (2020)","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60924-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:40:01Z","timestamp":1716349201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60924-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031609237","9783031609244"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60924-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Laguna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"22 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}