default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTjark Vredeveld
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Lars Rohwedder, Ashkan Safari, Tjark Vredeveld:
A k-swap Local Search for Makespan Scheduling. CoRR abs/2401.05956 (2024)- 2021
- [j23]Moritz Buchem, Tjark Vredeveld:
Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines. Comput. Oper. Res. 125: 105093 (2021) - [j22]Tim Ophelders, Roel Lambers
, Frits C. R. Spieksma, Tjark Vredeveld:
A note on equitable Hamiltonian cycles. Discret. Appl. Math. 303: 127-136 (2021) - [j21]José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld:
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals. Math. Oper. Res. 46(4): 1452-1478 (2021) - [c19]Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. ICALP 2021: 42:1-42:17 - 2020
- [i4]Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. CoRR abs/2007.09333 (2020)
2010 – 2019
- 2018
- [j20]José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld:
Recent developments in prophet inequalities. SIGecom Exch. 17(1): 61-70 (2018) - 2017
- [c18]José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld:
Posted Price Mechanisms for a Random Stream of Customers. EC 2017: 169-186 - 2016
- [j19]Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica 76(4): 1077-1096 (2016) - [j18]Tobias Harks, Tim Oosterwijk, Tjark Vredeveld:
A logarithmic approximation for polymatroid congestion games. Oper. Res. Lett. 44(6): 712-717 (2016) - [c17]Verena Jung, Marianne Peeters, Tjark Vredeveld:
Drivers and Resistors for Supply Chain Collaboration. OR 2016: 623-628 - [r1]Tjark Vredeveld:
Vector Scheduling Problems. Encyclopedia of Algorithms 2016: 2323-2326 - 2015
- [c16]Veerle Timmermans, Tjark Vredeveld:
Scheduling with State-Dependent Machine Speed. WAOA 2015: 196-208 - 2014
- [j17]Nicole Megow, Tjark Vredeveld:
A Tight 2-Approximation for Preemptive Stochastic Scheduling. Math. Oper. Res. 39(4): 1297-1310 (2014) - [j16]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed performance guarantees for local search. Math. Program. 146(1-2): 185-218 (2014) - [c15]Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. LATIN 2014: 47-59 - [c14]Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Real-Time Scheduling on Identical Machines. LATIN 2014: 550-561 - 2012
- [j15]Tjark Vredeveld:
Stochastic online scheduling. Comput. Sci. Res. Dev. 27(3): 181-187 (2012) - [j14]Benjamin Hiller, Tjark Vredeveld:
Probabilistic alternatives for competitive analysis. Comput. Sci. Res. Dev. 27(3): 189-196 (2012) - [j13]Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld:
Dynamic pricing problems with elastic demand. Oper. Res. Lett. 40(3): 175-179 (2012) - [j12]Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld:
Performance guarantees of jump neighborhoods on restricted related parallel machines. Oper. Res. Lett. 40(4): 287-291 (2012) - 2011
- [c13]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. ESA 2011: 772-783 - [c12]Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld:
Learning in Stochastic Machine Scheduling. WAOA 2011: 21-34 - [i3]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. CoRR abs/1105.2686 (2011) - 2010
- [c11]Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld:
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. LATIN 2010: 108-119
2000 – 2009
- 2008
- [j11]Sven Oliver Krumke, Sleman Saliba, Tjark Vredeveld, Stephan Westphal:
Approximation algorithms for a vehicle routing problem. Math. Methods Oper. Res. 68(2): 333-359 (2008) - [j10]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing with monotonicity constraint. Oper. Res. Lett. 36(5): 609-614 (2008) - [c10]Benjamin Hiller, Tjark Vredeveld:
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison. ESA 2008: 528-539 - 2007
- [j9]Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. INFORMS J. Comput. 19(1): 52-63 (2007) - [c9]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60 - [c8]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Bundle Pricing with Comparable Items. ESA 2007: 475-486 - [c7]Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. WAOA 2007: 41-54 - 2006
- [j8]Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electron. Notes Discret. Math. 25: 29-33 (2006) - [j7]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Math. Oper. Res. 31(1): 85-108 (2006) - [j6]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling. Math. Oper. Res. 31(3): 513-525 (2006) - [j5]Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to whack moles. Theor. Comput. Sci. 361(2-3): 329-341 (2006) - [c6]Nicole Megow, Tjark Vredeveld:
Approximation in Preemptive Stochastic Online Scheduling. ESA 2006: 516-527 - 2005
- [c5]Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld:
The Online Target Date Assignment Problem. WAOA 2005: 230-243 - [i2]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Algorithms for Optimization with Incomplete Information 2005 - [i1]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [c4]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Stochastic Online Scheduling on Parallel Machines. WAOA 2004: 167-180 - 2003
- [j4]Arie de Bruin, Gerard A. P. Kindervater, Tjark Vredeveld, Albert P. M. Wagelmans:
Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents. Constraints An Int. J. 8(2): 209-218 (2003) - [j3]Tjark Vredeveld, Jan Karel Lenstra:
On local search for the generalized graph coloring problem. Oper. Res. Lett. 31(1): 28-34 (2003) - [j2]Cor A. J. Hurkens, Tjark Vredeveld:
Local search for multiprocessor scheduling: how many moves does it take to a local optimum? Oper. Res. Lett. 31(2): 137-141 (2003) - [c3]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003: 462-471 - [c2]Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to Whack Moles. WAOA 2003: 192-205 - 2002
- [j1]Tjark Vredeveld, Cor A. J. Hurkens:
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines. INFORMS J. Comput. 14(2): 175-189 (2002) - 2001
- [c1]Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. IPCO 2001: 370-382
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-08-05 20:23 CEST 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:
