| Publication | Date of Publication | Type |
|---|
A triple bottom line optimization model for assignment and routing of on-demand home services
Computers & Operations Research | 2024-07-08 | Paper |
Designing an optimal sequence of non-pharmaceutical interventions for controlling COVID-19
European Journal of Operational Research | 2022-08-03 | Paper |
A tailored Benders decomposition approach for last-mile delivery with autonomous robots
European Journal of Operational Research | 2022-02-23 | Paper |
Approximation of the double traveling salesman problem with multiple stacks
Theoretical Computer Science | 2021-06-23 | Paper |
An exact method for assortment optimization under the nested logit model
European Journal of Operational Research | 2021-06-07 | Paper |
Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation?
Annals of Operations Research | 2021-01-06 | Paper |
Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
European Journal of Operational Research | 2020-05-27 | Paper |
Robust location of new housing developments using a choice model
Annals of Operations Research | 2019-03-06 | Paper |
Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
Computers & Operations Research | 2019-02-14 | Paper |
Robust optimization for non-linear impact of data variation
Computers & Operations Research | 2018-08-08 | Paper |
Optimizing healthcare network design under reference pricing and parameter uncertainty
European Journal of Operational Research | 2018-02-06 | Paper |
Improved approximation of the general soft-capacitated facility location problem
RAIRO - Operations Research | 2018-01-12 | Paper |
Hybrid column generation for large-size covering integer programs: application to transportation planning
Computers & Operations Research | 2016-11-10 | Paper |
Fast machine reassignment
Annals of Operations Research | 2016-11-07 | Paper |
A branch-and-price-and-cut approach for sustainable crop rotation planning
European Journal of Operational Research | 2016-07-06 | Paper |
A note on the clustered set covering problem
Discrete Applied Mathematics | 2015-09-22 | Paper |
Solving the electricity production planning problem by a column generation based heuristic
Journal of Scheduling | 2014-02-05 | Paper |
Approximation of the clustered set covering problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A MIP flow model for crop-rotation planning in a context of forest sustainable development
Annals of Operations Research | 2012-03-08 | Paper |
Edge cover by connected bipartite subgraphs
Annals of Operations Research | 2011-11-17 | Paper |
The minimum bounded-diameter spanning forest problem is log-approximable
| 2011-01-28 | Paper |
Airline crew pairing optimization
| 2011-01-03 | Paper |
Master-slave strategy and polynomial approximation
Computational Optimization and Applications | 2003-08-26 | Paper |
scientific article; zbMATH DE number 1330076 (Why is no real title available?)
| 1999-09-01 | Paper |
