Get started
Author

Martijn van Ee

Observed names: M. van Ee, van Ee, Martijn
ORCID: 0000-0002-7724-8990
Observed ORCID: 0000-0002-7724-8990
OpenAlex ID: A5044760370
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem
2021 · Martijn van Ee · Operations Research Letters · 19
PDF
Routing under Uncertainty: Approximation and Complexity
2017 · Martijn van Ee · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 16
PDF
Complexity of inventory routing problems when routing is easy
2019 · Annelieke C. Baller, Martijn van Ee, et al. · Networks · 13
PDF
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
2022 · Thomas Bosman, Martijn van Ee, et al. · Algorithmica · 12
PDF
The A Priori Traveling Repairman Problem
2017 · Martijn van Ee, René Sitters · Algorithmica · 9
PDF
Some notes on bounded starwidth graphs
2017 · Martijn van Ee · Information Processing Letters · 6
A priori TSP in the scenario model
2018 · Martijn van Ee, Leo van Iersel, et al. · Discrete Applied Mathematics · 5
PDF
Approximation and complexity of multi-target graph search and the Canadian traveler problem
2018 · Martijn van Ee, René Sitters · Theoretical Computer Science · 4
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
2018 · Thomas Bosman, Martijn van Ee, et al. · Lecture notes in computer science · 4
PDF
Routing Under Uncertainty: The a priori Traveling Repairman Problem
2015 · Martijn van Ee, René Sitters · Lecture notes in computer science · 4
A priori TSP in the Scenario Model
2017 · Martijn van Ee, Leo van Iersel, et al. · Lecture notes in computer science · 3
PDF
On the Complexity of Master Problems
2015 · Martijn van Ee, René Sitters · Lecture notes in computer science · 3
On efficient algorithms for finding efficient salvo policies
2020 · Martijn van Ee · Naval Research Logistics (NRL) · 2
The Chinese deliveryman problem
2019 · Martijn van Ee, René Sitters · 4OR · 2
PDF
Total Completion Time Scheduling Under Scenarios
2025 · Thomas Bosman, Martijn van Ee, et al. · Theory of Computing Systems · 1
Evaluating ship-to-shore schedules using simulation
2025 · Mette Wagenvoort, Paul Bouman, et al. · The Journal of Defense Modeling and Simulation Applications Methodology Technology · 1
Exact and heuristic approaches for the ship-to-shore problem
2024 · M. Wagenvoort, P.C. Bouman, et al. · European Journal of Operational Research · 1
Total Completion Time Scheduling Under Scenarios
2023 · Thomas Bosman, Martijn van Ee, et al. · Lecture notes in computer science · 1
PDF
Approximability of the dispersed p→ -neighbor k -supplier problem
2020 · Martijn van Ee · Discrete Applied Mathematics · 1
On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle
2026 · Martijn van Ee · Theoretical Computer Science
Approximation Algorithms for Graph Search Problems with Imperfect Detection
2025 · Martijn van Ee, René Sitters · Lecture notes in computer science
Exact and approximation algorithms for routing a convoy through a graph
2024 · Martijn van Ee, Tim Oosterwijk, et al. · Mathematical Programming
Chapter 12. Prevention and Detection of Adversarial Threats to Vital Infrastructure at Sea : An Operational Analysis Approach
2024 · Martijn van Ee, René Janssen, et al. · Leiden University Press eBooks
PDF
CHAPTER 8 Applying GTSP-algorithms in maritime patrolling missions that require mutual support
2023 · Martijn van Ee, Geraldo de Lima Filho, et al. · Leiden University Press eBooks
PDF
Works count: 26
Citation count: 107
H-index: 6
I10-index: 4
Year
Topic
Type