Tjark Vredeveld
Personal Details
First Name: Tjark
Middle Name:
Last Name: Vredeveld
Suffix:
RePEc Short-ID: pvr16
Email: [This author has chosen not to make the email address public]
Homepage:
Postal Address:
Phone:
Affiliation
(in no particular order)School of Business and Economics
Location: Maastricht, Netherlands
Maastricht University
Homepage: http://www.maastrichtuniversity.nl/sbe
Email:
Phone:
Fax:
Postal: Postbus 616, 6200 MD Maaastricht
Handle: RePEc:edi:femaanl (more details at EDIRC)Maastricht research school of Economics of TEchnology and ORganizations (METEOR)
Location: Maastricht, Netherlands
School of Business and Economics
Maastricht University
Homepage: http://www.meteorphd.com/
Email:
Phone: + 31 (0) 43 388 3830
Fax: + 31 (0) 43 325 8544
Postal: P.O. Box 616, 6200 MD Maastricht
Handle: RePEc:edi:meteonl (more details at EDIRC)
Works
Download all references for this author: available formats: HTML (with abstracts), plain text (with abstracts), BibTeX, RIS (EndNote), ReDIF
Working papers
- Recalde Diego & Rutten Cyriel & Schuurman Petra & Vredeveld Tjark, 2009. "Local search performance guarantees for restricted related parallel machine scheduling," Research Memoranda 061, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Hiller Benjamin & Vredeveld Tjark, 2009. "Simple optimality proofs for Least Recently Used in the presence of locality of reference," Research Memoranda 055, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Hiller Benjamin & Vredeveld Tjark, 2009. "Probabilistic alternatives for competitive analysis," Research Memoranda 053, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Megow Nicole & Vredeveld Tjark, 2009. "Approximating Preemptive Stochastic Scheduling," Research Memoranda 054, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Hiller, Benjamin & Vredeveld, Tjark, 2008. "Probabilistic analysis of Online Bin Coloring algorithms via Stochastic Comparison," Research Memoranda 006, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Grigoriev, Alexander & Loon, Joyce van & Sviridenko, Maxim & Uetz, Marc & Vredeveld, Tjark, 2008.
"Optimal Bundle Pricing with Monotonicity Constraint,"
Research Memoranda
015, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Grigoriev, A. & Loon, J. van & Sviridenko, M. & Uetz, M. & Vredeveld, T., 2008. "Optimal bundle pricing with monotonicity constraint," Open Access publications from Maastricht University urn:nbn:nl:ui:27-23080, Maastricht University.
- Krumke, Sven O. & Saliba, Sleman & Vredeveld, Tjark & Westphal, Stephan, 2006. "Approximation algorithms for a vehicle routing problem," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17090, Maastricht University.
- Megow, Nicole & Vredeveld, Tjark, 2006.
"Approximation Results for Preemptive Stochastic Online Scheduling,"
Research Memoranda
053, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Megow, Nicole & Vredeveld, Tjark, 2006. "Approximation results for preemptive stochastic online scheduling," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17092, Maastricht University.
- Grigoriev, Alexander & Loon, Joyce van & Uetz, Marc & Vredeveld, Tjark, 2006. "Optimal Bundle Pricing for Homogeneous Items," Research Memoranda 050, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Becchetti, Luca & Leonardi, Stefano & Marchetti-Spaccamela, Alberto & Schafer, Guido & Vredeveld, Tjark, 2006. "Average-case and smoothed competitive analysis of the multilevel feedback algorithm," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17093, Maastricht University.
- Brueggemann,Tobias & Hurink, Johann L. & Vredeveld, Tjark & Woeginger, Gerhard J., 2006. "Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines," Research Memoranda 052, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Heinz,S. & Krumke,S.O. & Megow,N. & Rambau,J. & Tuchscherer,A. & Vredeveld,T., 2005. "The Online Target Date Assignment Problem," Research Memoranda 055, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Megow, Nicole & Uetz, Marc & Vredeveld, Tjark, 2005. "Stochastic online scheduling on parallel machines," Open Access publications from Maastricht University urn:nbn:nl:ui:27-4901, Maastricht University.
- Schuurman,Petra & Vredeveld,Tjark, 2005. "Performance Guarantees of Local Search for Multiprocessor Scheduling," Research Memoranda 054, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Megow, Nicole & Uetz , Marc & Vredeveld, Tjark, 2004.
"Models and algorithms for stochastic online scheduling,"
Open Access publications from Maastricht University
urn:nbn:nl:ui:27-5884, Maastricht University.
- Megow, Nicole & Uetz, Marc & Vredeveld, Tjark, 2006. "Models and algorithms for stochastic online scheduling," Open Access publications from Maastricht University urn:nbn:nl:ui:27-12045, Maastricht University.
- Vredeveld, Tjark & Lenstra, Jan Karel, 2003. "On local search for the generalized graph coloring problem," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17096, Maastricht University.
- Krumke, Sven O. & Megow, Nicole & Vredeveld, Tjark, 2003. "How to Whack Moles," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17094, Maastricht University.
- Hurkens, C.A.J. & Vredeveld, T., 2003. "Local search for multiprocessor scheduling: how many moves doet it take to a local optimum?," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17095, Maastricht University.
- Vredeveld, Tjark & Hurkens, Cor, 2002. "Experimental comparison of approximation algorithms for scheduling unrelated parallel machines," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17097, Maastricht University.
- Vredeveld, Tjark, 2002. "Combinatorial Approximation Algorithms Guaranteed Versus Experimental Performance," Open Access publications from Maastricht University urn:nbn:nl:ui:27-17098, Maastricht University.
- Arie de Bruin & Tjark Vredeveld & Albert Wagelmans, 1999.
"Finding a Feasible Solution for a Simple LP Problem using Agents,"
Tinbergen Institute Discussion Papers
99-037/4, Tinbergen Institute.
- Bruin, A. de & Kindervater, G.A.P. & Vredeveld, T. & Wagelmans, A.P.M., 1999. "Finding a Feasible Solution for a Simple LP Problem using Agents," Econometric Institute Report EI 9921/A, Erasmus University Rotterdam, Econometric Institute.
NEP Fields
10 papers by this author were announced in NEP, and specifically in the following field reports (number of papers):- NEP-CMP: Computational Economics (2) 2006-01-01 2006-12-16
- NEP-MIC: Microeconomics (2) 2006-12-16 2008-07-30
- NEP-MKT: Marketing (2) 2006-12-16 2008-07-30
- NEP-ORE: Operations Research (1) 2008-06-21
Statistics
Most cited item
- Megow, Nicole & Uetz , Marc & Vredeveld, Tjark, 2004. "Models and algorithms for stochastic online scheduling," Open Access publications from Maastricht University urn:nbn:nl:ui:27-5884, Maastricht University.
Most downloaded item (past 12 months)
- Recalde Diego & Rutten Cyriel & Schuurman Petra & Vredeveld Tjark, 2009. "Local search performance guarantees for restricted related parallel machine scheduling," Research Memoranda 061, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
Access and download statistics for all items
Co-authorship network on CollEc
Corrections
To update listings or check citations waiting for approval, Tjark Vredeveld should log into the RePEc Author ServiceTo make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to correct references and citations.
To link different versions of the same work, where versions have a different title, email the respective handles to
Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

