Victor Verdugo
From pricing to prophets, and back!
J Correa, P Foncea, D Pizarro, V Verdugo
Operations Research Letters 47 (1), 25-29, 2019
Strong algorithms for the ordinal matroid secretary problem
JA Soto, A Turkieltaub, V Verdugo
Mathematics of Operations Research 46 (2), 642-673, 2021
Strong LP formulations for scheduling splittable jobs on unrelated machines
J Correa, A Marchetti-Spaccamela, J Matuschke, L Stougie, O Svensson, ...
Mathematical Programming 154, 305-328, 2015
Split scheduling with uniform setup times
F Schalekamp, R Sitters, S Van Der Ster, L Stougie, V Verdugo, ...
Journal of scheduling 18, 119-129, 2015
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
J Correa, V Verdugo, J Verschae
Operations Research Letters 44 (4), 469-473, 2016
Semidefinite and linear programming integrality gaps for scheduling identical machines
A Kurpisz, M Mastrolilli, C Mathieu, T Mömke, V Verdugo, A Wiese
Mathematical Programming 172, 231-248, 2018
A scheduling model inspired by control theory
S Baruah, V Bonifaci, A Marchetti-Spaccamela, V Verdugo
Proceedings of the 25th International Conference on Real-Time Networks and …, 2017
Skyline computation with noisy comparisons
B Groz, F Mallmann-Trenn, C Mathieu, V Verdugo
International Workshop on Combinatorial Algorithms, 289-303, 2020
Proportional apportionment: A case study from the chilean constitutional convention
J Cembrano, J Correa, G Diaz, V Verdugo
Proceedings of the 1st ACM Conference on Equity and Access in Algorithms …, 2021
Brief Announcement: How Large is your Graph?
V Kanade, F Mallmann-Trenn, V Verdugo
Proceedings of the ACM Symposium on Principles of Distributed Computing, 195-197, 2017
Multidimensional political apportionment
J Cembrano, J Correa, V Verdugo
Proceedings of the National Academy of Sciences 119 (15), e2109305119, 2022
The competition complexity of dynamic pricing
J Brustle, J Correa, P Dütting, V Verdugo
Proceedings of the 23rd ACM Conference on Economics and Computation, 303-320, 2022
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
V Verdugo, J Verschae, A Wiese
Mathematical Programming 183, 583-618, 2020
Online combinatorial assignment in independence systems
J Marinkovic, JA Soto, V Verdugo
International Conference on Integer Programming and Combinatorial …, 2024
A 2-approximation for the bounded treewidth sparsest cut problem in Time
V Cohen-Addad, T Mömke, V Verdugo
Mathematical Programming, 1-17, 2024
Preserving diversity when partitioning: a geometric approach
S Perez-Salazar, A Torrico, V Verdugo
Proceedings of the 1st ACM Conference on Equity and Access in Algorithms …, 2021
The Convergence Rates of Blockchain Mining Games: A Markovian Approach
A Jofré, A Pardo, D Salas, V Verdugo, J Verschae
arXiv preprint arXiv:2107.08077, 2021
Optimal revenue guarantees for pricing in large markets
J Correa, D Pizarro, V Verdugo
Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus …, 2021
On the extension complexity of scheduling polytopes
HR Tiwary, V Verdugo, A Wiese
Operations Research Letters 48 (4), 472-479, 2020
Monotone Randomized Apportionment
J Correa, P Gölz, U Schmidt-Kraepelin, J Tucker-Foltz, V Verdugo
arXiv preprint arXiv:2405.03687, 2024
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20