Tim Oosterwijk

According to our database, Tim Oosterwijk authored at least 14 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Exact and Approximation Algorithms for Routing a Convoy Through a Graph.

Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

On the Price of Anarchy for Flows over Time.

José Correa, Andrés Cristi, Tim Oosterwijk

Math. Oper. Res., 2022

Bicriteria Nash Flows over Time.

Tim Oosterwijk, Daniel Schmand, Marc Schröder

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

2021

Cyclic lot-sizing problems with sequencing costs.

Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk

J. Sched., 2021

Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals.

José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld

Math. Oper. Res., 2021

The Secretary Problem with Independent Sampling.

José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

A General Framework for Energy-Efficient Cloud Computing Mechanisms.

Antonios Antoniadis, Andrés Cristi, Tim Oosterwijk, Alkmini Sgouritsa

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2018

Recent developments in prophet inequalities.

José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld

SIGecom Exch., 2018

2017

Posted Price Mechanisms for a Random Stream of Customers.

José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

A logarithmic approximation for polymatroid congestion games.

Tobias Harks, Tim Oosterwijk, Tjark Vredeveld

Oper. Res. Lett., 2016

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.

Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan

Algorithmica, 2016

2015

Tractable Cases of (*, 2)-Bounded Parsimony Haplotyping.

Judith Keijsper, Tim Oosterwijk

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

On local search and LP and SDP relaxations for k-Set Packing.

Tim Oosterwijk

CoRR, 2015

2014

High Multiplicity Scheduling with Switching Costs for Few Products.

Michaël Gabay, Alexander Grigoriev, Vincent J. C. Kreuzen, Tim Oosterwijk

Proceedings of the Operations Research Proceedings 2014, 2014