The following pages link to Víctor Verdugo (Q896268):
Displayed 18 items.
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- (Q1694776) (redirect page) (← links)
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- From pricing to prophets, and back! (Q2294260) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- Optimal revenue guarantees for pricing in large markets (Q2670927) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- (Q4607929) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- Skyline Computation with Noisy Comparisons (Q5041199) (← links)
- Brief Announcement (Q5368962) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints (Q6109005) (← links)
- Apportionment with parity constraints (Q6120934) (← links)