Sophie Huiberts

Full Name

S. Huiberts

Email

S.Huiberts@cwi.nl

Phone

+31 20 592 4093

Room

M239

Department(s)

Networks and Optimization

Function(s)

Guest

Sophie Huiberts

Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2024). A nearly optimal randomized algorithm for explorable heap selection. Mathematical Programming, 2024, 1–22. doi:10.1007/s10107-024-02145-5
Dadush, D., Hojny, C., Huiberts, S., & Weltge, S. (2023). A simple method for convex optimization in the oracle model. Mathematical Programming Series B. doi:10.1007/s10107-023-02005-8
Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2023). A nearly optimal randomized algorithm for explorable heap selection. In Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023 (pp. 29–43). doi:10.1007/978-3-031-32726-1_3
Dadush, D., Huiberts, S., Natura, B., & Végh, L. (2023). A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Mathematical Programming. doi:10.1007/s10107-023-01956-2
Bonnet, G., Dadush, D., Grupel, U., Huiberts, S., & Livshyts, G. (2022). Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. In Leibniz International Proceedings in Informatics (pp. 18:1–18:15). doi:10.4230/LIPIcs.SoCG.2022.18
Dadush, D., Hojny, C., Huiberts, S., & Weltge, S. (2022). A simple method for convex optimization in the oracle model. In Integer Programming and Combinatorial Optimization (pp. 154–167). doi:10.1007/978-3-031-06901-7_12
Borst, S., Dadush, D., Huiberts, S., & Tiwari, S. (2022). On the integrality gap of binary integer programs with Gaussian data. Mathematical Programming Series B, 197, 1221–1263. doi:10.1007/s10107-022-01828-1
Huiberts, S. (2022, May 16). Geometric aspects of linear programming : shadow paths, central paths, and a cutting plane method. Retrieved from http://dx.doi.org/10.33540/1251
Borst, S., Dadush, D., Huiberts, S., & Tiwari, S. (2021). On the integrality gap of binary integer programs with Gaussian data. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 427–442). doi:10.1007/978-3-030-73879-2_30
Dadush, D., & Huiberts, S. (2020). A friendly smoothed analysis of the simplex method. SIAM Journal on Computing, 49(5). doi:10.1137/18M1197205

Gijs de Leve Prize 2020-2023 (2024)
Stieltjesprijs 2021-2022 (2023)