Bridging -sum and CVaR optimization in MILP. | 0 | 0.34 | 2019 |
Mixed integer linear programming models for optimal crop selection. | 3 | 0.44 | 2017 |
The probabilistic orienteering problem. | 3 | 0.41 | 2017 |
Optimal interval scheduling with a resource constraint | 3 | 0.42 | 2014 |
Balancing profits and costs on trees. | 7 | 0.53 | 2013 |
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits. | 8 | 0.51 | 2013 |
A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits. | 1 | 0.35 | 2012 |
On the complexity of interval scheduling with a resource constraint | 13 | 0.61 | 2011 |
An approximate algorithm for a high-multiplicity parallel machine scheduling problem | 1 | 0.35 | 2010 |
Exact and approximate algorithms for high-multiplicity parallel machine scheduling | 7 | 0.52 | 2009 |
On the bin packing problem with a fixed number of object weights | 4 | 0.45 | 2007 |
Robust explicit MPC based on approximate multi-parametric convex programming | 19 | 1.44 | 2006 |
An Algorithm for Approximate Multiparametric Convex Programming | 26 | 2.33 | 2006 |
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots | 23 | 0.92 | 2006 |
An asymptotically exact algorithm for the high-multiplicity bin packing problem | 7 | 0.53 | 2005 |
A fresh view on the tolerance approach to sensitivity analysis in linear programming | 18 | 0.99 | 2005 |
Inner and outer approximations of polytopes using boxes | 24 | 1.57 | 2004 |
Multiparametric demand transportation problem | 0 | 0.34 | 2002 |
A reverse search algorithm for the neighborhood problem | 1 | 0.38 | 1999 |
Optimal Allocation of Two Fixed Service Units Acting as M/G/1 Queues | 0 | 0.34 | 1996 |