Tjark Vredeveld

According to our database1, Tjark Vredeveld authored at least 41 papers between 2002 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals.
Math. Oper. Res., 2021

A note on equitable Hamiltonian cycles.
Discret. Appl. Math., 2021

Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines.
Comput. Oper. Res., 2021

Additive Approximation Schemes for Load Balancing Problems.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2018
Recent developments in prophet inequalities.
SIGecom Exch., 2018

2017
Posted Price Mechanisms for a Random Stream of Customers.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Vector Scheduling Problems.
Encyclopedia of Algorithms, 2016

A logarithmic approximation for polymatroid congestion games.
Oper. Res. Lett., 2016

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
Algorithmica, 2016

Drivers and Resistors for Supply Chain Collaboration.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015
Scheduling with State-Dependent Machine Speed.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014
Smoothed performance guarantees for local search.
Math. Program., 2014

A Tight 2-Approximation for Preemptive Stochastic Scheduling.
Math. Oper. Res., 2014

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Approximating Real-Time Scheduling on Identical Machines.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2012
Performance guarantees of jump neighborhoods on restricted related parallel machines.
Oper. Res. Lett., 2012

Dynamic pricing problems with elastic demand.
Oper. Res. Lett., 2012

Stochastic online scheduling.
Comput. Sci. Res. Dev., 2012

Probabilistic alternatives for competitive analysis.
Comput. Sci. Res. Dev., 2012

2011
Learning in Stochastic Machine Scheduling.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2010
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2008
Optimal bundle pricing with monotonicity constraint.
Oper. Res. Lett., 2008

Approximation algorithms for a vehicle routing problem.
Math. Methods Oper. Res., 2008

Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison.
Proceedings of the Algorithms, 2008

2007
Performance Guarantees of Local Search for Multiprocessor Scheduling.
INFORMS J. Comput., 2007

Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Bundle Pricing with Comparable Items.
Proceedings of the Algorithms, 2007

Optimal bundle pricing for homogeneous items.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
How to whack moles.
Theor. Comput. Sci., 2006

Models and Algorithms for Stochastic Online Scheduling.
Math. Oper. Res., 2006

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.
Math. Oper. Res., 2006

Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines.
Electron. Notes Discret. Math., 2006

Approximation in Preemptive Stochastic Online Scheduling.
Proceedings of the Algorithms, 2006

2005
The Online Target Date Assignment Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Stochastic Online Scheduling on Parallel Machines.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003
On local search for the generalized graph coloring problem.
Oper. Res. Lett., 2003

Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
Oper. Res. Lett., 2003

Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents.
Constraints An Int. J., 2003

How to Whack Moles.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines.
INFORMS J. Comput., 2002


  Loading...