Counterfactual Routing Using Integer Programming with Constraint Generation

The paper "Counterfactual Routing Using Integer Programming with Constraint Generation" presents a solution to the IJCAI 2025 Counterfactual Routing Competition. The authors model the problem as an integer program and iteratively add constraints until an exact solution is found. In evaluation on held‑out test instances, their method ranked fourth in solution quality and was the fastest, averaging 9.0 seconds versus 118.8 seconds for the next‑fastest submission.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.