| A solution merging heuristic for the steiner problem in graphs using tree decompositions T Bosman Experimental Algorithms: 14th International Symposium, SEA 2015, Paris …, 2015 | 9 | 2015 |
| Approximation algorithms for replenishment problems with fixed turnover times T Bosman, M Van Ee, Y Jiao, A Marchetti-Spaccamela, R Ravi, L Stougie LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 8 | 2018 |
| Parallel machine scheduling with a single resource per job T Janssen, C Swennenhuis, A Bitar, T Bosman, D Gijswijt, L van Iersel, ... arXiv preprint arXiv:1809.05009, 2018 | 7 | 2018 |
| Fixed-order scheduling on parallel machines T Bosman, D Frascaria, N Olver, R Sitters, L Stougie Integer Programming and Combinatorial Optimization: 20th International …, 2019 | 6 | 2019 |
| Improved approximation algorithms for inventory problems T Bosman, N Olver International conference on integer programming and combinatorial …, 2020 | 5 | 2020 |
| Approximation algorithms for replenishment problems with fixed turnover times T Bosman, M van Ee, Y Jiao, A Marchetti-Spaccamela, R Ravi, L Stougie Algorithmica 84 (9), 2597-2621, 2022 | 4 | 2022 |
| Relax, round, reformulate: near-optimal algorithms for planning problems in network design and scheduling TN Bosman | 2 | 2019 |
| Exploring the tractability of the capped hose model T Bosman, N Olver 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 1 | 2017 |
| Total Completion Time Scheduling Under Scenarios T Bosman, M van Ee, E Ergen, C Imreh, A Marchetti-Spaccamela, ... International Workshop on Approximation and Online Algorithms, 104-118, 2023 | | 2023 |
| Minimizing the Sum of Completion Times Over Scenarios T Bosman, M van Ee, C Imreh, A Marchetti-Spaccamela, M Skutella, ... 13th Workshop on Models and Algorithms for Planning and Scheduling Problems, 11, 2017 | | 2017 |
Leen StougieSenior Researcher CWI, Prof. of Operations Research Vrije Universiteit, Amsterdam在 cwi.nl 的电子邮件经过验证
