Counterfactual Routing Using Integer Programming with Constraint Generation
In the final evaluation on held-out test instances, the 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.