arXiv (All)
open access
Counterfactual Routing Using Integer Programming with Constraint Generation
We present our submission to the IJCAI 2025 'Counterfactual Routing Competition' (CRC 25). The goal of the competition is to find counterfactual explanations for the shortest path problem. This requires deciding what the minimal changes to a road network would make a route chosen by the user the opt
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Counterfactual Explanations and the Scope of Contestability#725946
- The impact of using different choice functions when solving CSPs with autonomous search#935621
- Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers#948553
- 150+1 Probleme (și soluțiile lor) / 150+1 Problems (and their solutions).#111835
- Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search [Evaluando La Eficiencia De Utilizar Funciones De Selección En Búsqueda Autónoma Para Resolver Problemas De Satisfacción De Restricciones]#948006
Record · ID 926599
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive