Martijn van Ee

Orcid: 0000-0002-7724-8990

According to our database1, Martijn van Ee authored at least 15 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Total Completion Time Scheduling Under Scenarios.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Exact and Approximation Algorithms for Routing a Convoy Through a Graph.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Simple Policies for Capacitated Resupply Problems (Short Paper).
Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

2022
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.
Algorithmica, 2022

2021
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem.
Oper. Res. Lett., 2021

Approximability of the dispersed p→-neighbor k-supplier problem.
Discret. Appl. Math., 2021

2020
Complexity of inventory routing problems when routing is easy.
Networks, 2020

The Chinese deliveryman problem.
4OR, 2020

2018
Approximation and complexity of multi-target graph search and the Canadian traveler problem.
Theor. Comput. Sci., 2018

<i>A priori</i> TSP in the scenario model.
Discret. Appl. Math., 2018

The A Priori Traveling Repairman Problem.
Algorithmica, 2018

2017
Some notes on bounded starwidth graphs.
Inf. Process. Lett., 2017

2016
A priori TSP in the Scenario Model.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015
On the Complexity of Master Problems.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Routing Under Uncertainty: The a priori Traveling Repairman Problem.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014


  Loading...