| The a priori traveling repairman problem M van Ee, R Sitters Algorithmica 80, 2818-2833, 2018 | 12 | 2018 |
| Complexity of inventory routing problems when routing is easy AC Baller, M van Ee, M Hoogeboom, L Stougie Networks 75 (2), 113-123, 2020 | 10 | 2020 |
| A priori TSP in the scenario model M van Ee, L van Iersel, T Janssen, R Sitters Discrete Applied Mathematics 250, 331-341, 2018 | 8 | 2018 |
| 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 |
| A 12/7-approximation algorithm for the discrete bamboo garden trimming problem M van Ee Operations Research Letters 49 (5), 645-649, 2021 | 7 | 2021 |
| Approximation and complexity of multi-target graph search and the Canadian traveler problem M van Ee, R Sitters Theoretical Computer Science 732, 14-25, 2018 | 6 | 2018 |
| Routing Under Uncertainty: The a priori Traveling Repairman Problem M van Ee, R Sitters Approximation and Online Algorithms: 12th International Workshop, WAOA 2014 …, 2015 | 6 | 2015 |
| On the complexity of master problems M van Ee, R Sitters International Symposium on Mathematical Foundations of Computer Science, 567-576, 2015 | 5 | 2015 |
| 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 |
| Some notes on bounded starwidth graphs M van Ee Information Processing Letters 125, 9-14, 2017 | 4 | 2017 |
| Routing under uncertainty: approximation and complexity M van Ee | 4 | 2017 |
| Approximability of the dispersed p→-neighbor k-supplier problem M van Ee Discrete Applied Mathematics 289, 219-229, 2021 | 2 | 2021 |
| Prevention and detection of adversarial threats to vital infrastructure at sea: An operational analysis approach M van Ee, R Janssen, R Jurrius, H Melissen, H Monsuur, A van Oers CLIMATE SECU ITY AND THE MILITA Y, 253, 2023 | 1 | 2023 |
| The Chinese deliveryman problem M van Ee, R Sitters 4OR 18 (3), 341-356, 2020 | 1 | 2020 |
| On efficient algorithms for finding efficient salvo policies M van Ee Naval Research Logistics (NRL) 67 (2), 147-158, 2020 | 1 | 2020 |
| 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 |
| Simple Policies for Capacitated Resupply Problems (Short Paper) M Wagenvoort, M van Ee, P Bouman, KM Malone 23rd Symposium on Algorithmic Approaches for Transportation Modelling …, 2023 | | 2023 |
| Exact and Approximation Algorithms for Routing a Convoy Through a Graph M van Ee, T Oosterwijk, R Sitters, A Wiese 48th International Symposium on Mathematical Foundations of Computer Science …, 2023 | | 2023 |
| An Exact and Heuristic Approach for the Ship-to-Shore Problem M Wagenvoort, PC Bouman, M van Ee, TL Tessensohn, K Postek | | 2022 |
| 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, AmsterdamDirección de correo verificada de cwi.nl
