The following pages link to José Verschae (Q490329):
Displaying 35 items.
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- The online set aggregation problem (Q2294691) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- How to Pack Your Items When You Have to Buy Your Knapsack (Q2849898) (← links)
- Optimal Algorithms and a PTAS for Cost-Aware Scheduling (Q2946391) (← links)
- On the Configuration-LP for Scheduling on Unrelated Machines (Q3092258) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928) (← links)
- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods (Q3586447) (← links)
- A Robust PTAS for Machine Covering and Packing (Q3586449) (← links)
- Scheduling Periodic Tasks in a Hard Real-Time Environment (Q3587387) (← links)
- (Q4598212) (← links)
- Min-Sum Scheduling Under Precedence Constraints (Q4606348) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- (Q5091241) (← links)
- (Q5111361) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q5326607) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- Symmetry Exploitation for Online Machine Covering with Bounded Migration (Q5888934) (← links)
- The Power of Recourse for Online MST and TSP (Q5890825) (← links)
- The Power of Recourse for Online MST and TSP (Q5891122) (← links)
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders (Q5891554) (← links)
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders (Q5902163) (← links)
- On the geometry of symmetry breaking inequalities (Q5918422) (← links)
- On the geometry of symmetry breaking inequalities (Q5925642) (← links)
- Tight running times for minimum \(\ell_q\)-norm load balancing: beyond exponential dependencies on \(1/ \epsilon\) (Q6575086) (← links)
- Equilibrium dynamics in market games with exchangeable and divisible resources (Q6645365) (← links)
