| Publication | Date of Publication | Type |
|---|
Robust and distributionally robust shortest path problems: a survey
Computers & Operations Research | 2025-09-10 | Paper |
Conditional value‐at‐risk beyond finance: a survey
International Transactions in Operational Research | 2023-11-17 | Paper |
Trends in passenger transport optimisation
International Transactions in Operational Research | 2023-10-04 | Paper |
| Incorporating time-dependent demand patterns in the optimal location of capacitated charging stations | 2023-01-12 | Paper |
A dynamic and probabilistic orienteering problem
Computers & Operations Research | 2022-03-09 | Paper |
A kernel search heuristic for a fair facility location problem
Computers & Operations Research | 2022-03-07 | Paper |
| Metro stations as crowd-shipping catalysts: an empirical and computational study | 2021-09-16 | Paper |
On single-source capacitated facility location with cost and fairness objectives
European Journal of Operational Research | 2021-06-03 | Paper |
Bridging \(k\)-sum and CVaR optimization in MILP
Computers & Operations Research | 2019-02-19 | Paper |
Mixed integer linear programming models for optimal crop selection
Computers & Operations Research | 2018-07-11 | Paper |
The probabilistic orienteering problem
Computers & Operations Research | 2018-07-11 | Paper |
Robust Explicit MPC Based on Approximate Multiparametric Convex Programming
IEEE Transactions on Automatic Control | 2017-07-27 | Paper |
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
Computers & Operations Research | 2016-11-10 | Paper |
Optimal interval scheduling with a resource constraint
Computers & Operations Research | 2016-11-10 | Paper |
A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits
Algorithmic Operations Research | 2013-12-11 | Paper |
Balancing profits and costs on trees
Networks | 2013-08-06 | Paper |
On the complexity of interval scheduling with a resource constraint
Theoretical Computer Science | 2011-07-14 | Paper |
An approximate algorithm for a high-multiplicity parallel machine scheduling problem
Operations Research Letters | 2010-09-07 | Paper |
Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Journal of Scheduling | 2009-12-02 | Paper |
On the bin packing problem with a fixed number of object weights
European Journal of Operational Research | 2007-03-27 | Paper |
An algorithm for approximate multiparametric convex programming
Computational Optimization and Applications | 2006-11-17 | Paper |
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
International Transactions in Operational Research | 2006-09-14 | Paper |
An asymptotically exact algorithm for the high-multiplicity bin packing problem
Mathematical Programming. Series A. Series B | 2005-10-31 | Paper |
A fresh view on the tolerance approach to sensitivity analysis in linear programming
European Journal of Operational Research | 2005-08-01 | Paper |
An algorithm for approximate multiparametric linear programming
Journal of Optimization Theory and Applications | 2004-06-11 | Paper |
Inner and outer approximations of polytopes using boxes.
Computational Geometry | 2004-03-14 | Paper |
Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming
Journal of Optimization Theory and Applications | 2003-10-29 | Paper |
Multiparametric demand transportation problem
European Journal of Operational Research | 2002-07-03 | Paper |
A reverse search algorithm for the neighborhood problem
Operations Research Letters | 1999-12-19 | Paper |
Optimal Allocation of Two Fixed Service Units Acting as <i>M</i>/<i>G</i>/1 Queues
Transportation Science | 1996-11-25 | Paper |
The linear balancing flow problem
European Journal of Operational Research | 1993-09-15 | Paper |
