default search action
Martijn van Ee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Mette Wagenvoort
, Paul C. Bouman
Exact and heuristic approaches for the ship-to-shore problem. Eur. J. Oper. Res. 320(1): 115-131 (2025) - 2024
- [i3]Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela
Total Completion Time Scheduling Under Scenarios. CoRR abs/2402.19259 (2024) - 2023
- [c7]Mette Wagenvoort, Martijn van Ee, Paul C. Bouman, Kerry M. Malone:
Simple Policies for Capacitated Resupply Problems (Short Paper). ATMOS 2023: 18:1-18:6 - [c6]Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese:
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS 2023: 86:1-86:15 - [c5]Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela
Total Completion Time Scheduling Under Scenarios. WAOA 2023: 104-118 - 2022
- [j9]Thomas Bosman, Martijn van Ee
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. Algorithmica 84(9): 2597-2621 (2022) - 2021
- [j8]Martijn van Ee:
Approximability of the dispersed p→-neighbor k-supplier problem. Discret. Appl. Math. 289: 219-229 (2021) - [j7]Martijn van Ee
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem. Oper. Res. Lett. 49(5): 645-649 (2021) - 2020
- [j6]Martijn van Ee, René Sitters
The Chinese deliveryman problem. 4OR 18(3): 341-356 (2020) - [j5]Annelieke C. Baller
Complexity of inventory routing problems when routing is easy. Networks 75(2): 113-123 (2020) - [i2]Martijn van Ee:
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem. CoRR abs/2004.11731 (2020)
2010 – 2019
- 2018
- [j4]Martijn van Ee, René Sitters:
The A Priori Traveling Repairman Problem. Algorithmica 80(10): 2818-2833 (2018) - [j3]Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the scenario model. Discret. Appl. Math. 250: 331-341 (2018) - [j2]Martijn van Ee, René Sitters:
Approximation and complexity of multi-target graph search and the Canadian traveler problem. Theor. Comput. Sci. 732: 14-25 (2018) - [c4]Thomas Bosman
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. LATIN 2018: 217-230 - 2017
- [j1]Martijn van Ee:
Some notes on bounded starwidth graphs. Inf. Process. Lett. 125: 9-14 (2017) - [i1]Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie:
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. CoRR abs/1712.05218 (2017) - 2016
- [c3]Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the Scenario Model. WAOA 2016: 183-196 - 2015
- [c2]Martijn van Ee, René Sitters:
On the Complexity of Master Problems. MFCS (2) 2015: 567-576 - 2014
- [c1]Martijn van Ee, René Sitters:
Routing Under Uncertainty: The a priori Traveling Repairman Problem. WAOA 2014: 248-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: