research
∙
07/06/2022
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
The Euclidean shortest path problem (ESPP) is a well studied problem wit...
share
research
∙
01/21/2021
Better Short than Greedy: Interpretable Models through Optimal Rule Boosting
Rule ensembles are designed to provide a useful trade-off between predic...
research
∙
01/11/2021
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem
When solving hard multicommodity network flow problems using an LP-based...
research
∙
10/19/2020
Optimal Decision Lists using SAT
Decision lists are one of the most easily explainable machine learning m...
research
∙
07/29/2020