| Approximation Of The Double Traveling Salesman Problem With Multiple Stacks | 0 | 0.34 | 2021 |
| Solving utility-maximization selection problems with Multinomial Logit demand: Is the First-Choice model a good approximation? | 1 | 0.36 | 2020 |
| Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem. | 0 | 0.34 | 2019 |
| Robust Location of New Housing Developments Using a Choice Model | 1 | 0.36 | 2018 |
| Robust optimization for non-linear impact of data variation. | 0 | 0.34 | 2018 |
| Optimizing healthcare network design under reference pricing and parameter uncertainty. | 1 | 0.36 | 2017 |
| The Multicommodity-Ring Location Routing Problem | 3 | 0.37 | 2016 |
| Fast machine reassignment | 0 | 0.34 | 2016 |
| A branch-and-price-and-cut approach for sustainable crop rotation planning. | 8 | 0.63 | 2015 |
| A note on the Clustered Set Covering Problem. | 0 | 0.34 | 2014 |
| Solving the electricity production planning problem by a column generation based heuristic | 5 | 0.49 | 2013 |
| A MIP flow model for crop-rotation planning in a context of forest sustainable development. | 11 | 0.73 | 2011 |
| Edge cover by connected bipartite subgraphs. | 3 | 0.50 | 2011 |
| Approximation of the Clustered Set Covering Problem | 0 | 0.34 | 2010 |
| Improved approximation of the general soft-capacitated facility location problem. | 2 | 0.43 | 2007 |
| Edge cover by bipartite subgraphs | 2 | 0.80 | 2007 |
| Master-Slave Strategy and Polynomial Approximation | 11 | 0.81 | 2000 |
