Metraipolis › archive › dc_da7ee0af92d8
Counterfactual Routing Using Integer Programming with Constraint Generation — arXiv:2609.03707
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03707
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T01:11:11.079Z
- SHA-256 of the archived text
ed029c6185e2c01528f79f10c79007ded7cb9032507cc449d1eea43427af0c3b- Stable URL of this page
https://metraipolis.com/documento/dc_da7ee0af92d8
How to cite
Counterfactual Routing Using Integer Programming with Constraint Generation — arXiv:2609.03707 — arXiv (en), https://arxiv.org/abs/2609.03707 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da7ee0af92d8 (Metraipolis archive dc_da7ee0af92d8, sha256 ed029c6185e2c01528f79f10c79007ded7cb9032507cc449d1eea43427af0c3b)
BibTeX
@misc{dcda7ee0af92d8,
title = {Counterfactual Routing Using Integer Programming with Constraint Generation — arXiv:2609.03707},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03707},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da7ee0af92d8; sha256 ed029c6185e2c01528f79f10c79007ded7cb9032507cc449d1eea43427af0c3b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03707. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 optimal route. This enables explanations such as "Your suggested route would indeed have been optimal, if road X were not a bicycle path." Our solution models the problem as an integer program, iteratively incorporating constraints until an exact solution is found. In the final evaluation on held-out test instances, our method ranked fourth in solution quality and obtained its solution fastest on every instance, with an average runtime of 9.0 seconds compared to 118.8 seconds for the next-fastest submission. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-04 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.03707 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T00:28:02.870Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).