The following pages link to Tjark Vredeveld (Q403642):
Displaying 38 items.
- Smoothed performance guarantees for local search (Q403643) (← links)
- Dynamic pricing problems with elastic demand (Q439910) (← links)
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- (Q592379) (redirect page) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Approximation algorithms for a vehicle routing problem (Q953301) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- Finding a feasible solution for a class of distributed problems with a single sum constraint using agents (Q1405337) (← links)
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- How to whack moles (Q2503357) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- Scheduling with State-Dependent Machine Speed (Q2789002) (← links)
- Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines (Q2884532) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- Performance Guarantees of Local Search for Multiprocessor Scheduling (Q2892310) (← links)
- Learning in Stochastic Machine Scheduling (Q2896373) (← links)
- Smoothed Performance Guarantees for Local Search (Q3092279) (← links)
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (Q3439462) (← links)
- Bundle Pricing with Comparable Items (Q3527236) (← links)
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison (Q3541114) (← links)
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling (Q3557013) (← links)
- (Q4537756) (← links)
- Drivers and Resistors for Supply Chain Collaboration (Q4596521) (← links)
- (Q4788095) (← links)
- Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals (Q5026446) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm (Q5387966) (← links)
- Models and Algorithms for Stochastic Online Scheduling (Q5387994) (← links)
- Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds (Q5405027) (← links)
- Approximating Real-Time Scheduling on Identical Machines (Q5405072) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
- Approximation in Preemptive Stochastic Online Scheduling (Q5449555) (← links)
- Approximation and Online Algorithms (Q5713435) (← links)
- Approximation and Online Algorithms (Q5896932) (← links)
- Approximation and Online Algorithms (Q5898476) (← links)
