| Publication | Date of Publication | Type |
|---|
| A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem | 2025-01-15 | Paper |
| Approximating multiobjective optimization problems: how exact can you be? | 2024-10-09 | Paper |
| Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory | 2024-10-09 | Paper |
| A \((B + 1)\)-approximation for network flow interdiction with unit costs | 2024-06-20 | Paper |
| New ways in municipal flood mitigation: a mixed-integer programming approach and its practical application | 2023-12-12 | Paper |
| Integrated patient-to-room and nurse-to-patient assignment in hospital wards | 2023-09-19 | Paper |
| Approximating single- and multi-objective nonlinear sum and product knapsack problems | 2023-06-30 | Paper |
| Approximating biobjective minimization problems using general ordering cones | 2023-06-28 | Paper |
| Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems | 2023-05-24 | Paper |
| An approximation algorithm for a general class of multi-parametric optimization problems | 2022-10-04 | Paper |
| An approximation algorithm for a general class of parametric optimization problems | 2022-07-18 | Paper |
| Approximation Methods for Multiobjective Optimization Problems: A Survey | 2022-06-28 | Paper |
| The power of the weighted sum scalarization for approximating multiobjective optimization problems | 2022-02-14 | Paper |
| An approximation algorithm for network flow interdiction with unit costs and two capacities | 2021-12-08 | Paper |
| Approximating the product knapsack problem | 2021-09-28 | Paper |
| One-exact approximate Pareto sets | 2021-07-07 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible | 2020-09-03 | Paper |
| The Complexity of Escaping Labyrinths and Enchanted Forests. | 2020-08-11 | Paper |
| An FPTAS for a general class of parametric optimization problems | 2020-02-24 | Paper |
| Multistage interval scheduling games | 2019-12-30 | Paper |
| Assortment planning for multiple chain stores | 2019-08-16 | Paper |
| Full implementation of social choice functions in dominant strategies | 2019-06-24 | Paper |
| Competitive algorithms for multistage online scheduling | 2018-05-29 | Paper |
| A network simplex method for the budget-constrained minimum cost flow problem | 2018-05-25 | Paper |
| Capacitated network design games with weighted players | 2018-05-23 | Paper |
| Online interval scheduling with a bounded number of failures | 2018-04-04 | Paper |
| Regionalized Assortment Planning for Multiple Chain Stores | 2017-12-01 | Paper |
| A general approximation method for bicriteria minimization problems | 2017-09-13 | Paper |
| Maximum flows in generalized processing networks | 2017-08-03 | Paper |
| On the complexity and approximability of budget-constrained minimum cost flows | 2017-06-30 | Paper |
| Approximation schemes for the parametric knapsack problem | 2017-01-31 | Paper |
| Complexity and approximability of the maximum flow problem with minimum quantities | 2016-06-10 | Paper |
| The online knapsack problem with incremental capacity | 2016-05-17 | Paper |
| Budget-constrained minimum cost flows | 2016-05-11 | Paper |
| The generalized assignment problem with minimum quantities | 2016-03-15 | Paper |
| Convex generalized flows | 2015-07-06 | Paper |
| Packing items into several bins facilitates approximating the separable assignment problem | 2015-05-21 | Paper |
| A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items | 2013-09-20 | Paper |
| Minimum cost flows with minimum quantities | 2013-03-28 | Paper |
| Approximation algorithms for \(\mathrm{TTP(2)}\) | 2013-02-20 | Paper |
| Erratum to ``Minimum cost flows with minimum quantities | 2012-07-25 | Paper |
| Truthful mechanisms for selfish routing and two-parameter agents | 2011-11-23 | Paper |
| Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization | 2011-09-20 | Paper |
| Interval scheduling on related machines | 2011-06-30 | Paper |
| Complexity of the traveling tournament problem | 2011-02-02 | Paper |
| Approximating the Traveling Tournament Problem with Maximum Tour Length 2 | 2010-12-09 | Paper |
| Truthful mechanisms for selfish routing and two-parameter agents | 2009-12-01 | Paper |
| A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints | 2009-02-12 | Paper |
| Operational Research: Methods and Applications | N/A | Paper |
| Improving Patient Transport in Hospitals: A Literature Review of Operations Research Methods | N/A | Paper |
