Daniel Dadush

Full Name

Prof.dr. D.N. Dadush

D.N.Dadush@cwi.nl

Phone

+31 20 592 4210

Room

M234

Department(s)

Networks and Optimization

Function(s)

Scientific Staff Member, Researcher, Group leader

Homepage

https://homepages.cwi.nl/~dadush/

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., Koh, Z. K., Natura, B., & Végh, L. (2024). On circuit diameter bounds via circuit imbalances. Mathematical Programming, 206, 631–662. doi:10.1007/s10107-024-02107-x
Dadush, D., Koh, Z. K., Natura, B., Olver, N., & Végh, L. (2024). A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In Proceedings of the annual ACM symposium on Theory of Computing (pp. 1561–1572). doi:10.1145/3618260.3649764
Dadush, D., Eisenbrand, F. (Friedrich), & Rothvoss, T. (2024). From approximate to exact integer programming. Mathematical Programming. doi:10.1007/s10107-024-02084-1
Dadush, D., & Ramachandran, A. (2024). Strongly polynomial frame scaling to high precision. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2024 (pp. 962–981). doi:10.1137/1.9781611977912.36
Dadush, D., Koh, Z. K., Natura, B., & Végh, L. (2023). An accelerated Newton–Dinkelbach method and its application to Two Variables per Inequality Systems. Mathematics of Operations Research, 48(4), 1934–1958. doi:10.1287/moor.2022.1326
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., Eisenbrand, F., & Rothvoss, T. (2023). From approximate to exact integer programming. In Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023 (pp. 100–114). doi:10.1007/978-3-031-32726-1_8
Dadush, D., Léonard, A. (Arthur), Rohwedder, L., & Verschae, J. (2023). Optimizing low dimensional functions over the integers. In Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023 (pp. 115–126). doi:10.1007/978-3-031-32726-1_9

Van Dantzig Prize (2020)
Best Paper Award at CCC'20 (2020)
Towards a Quantitative Theory of Integer Programming (2018)
Tucker Prize (2015)

Editor: Associate editor Journal: Discrete Optimization
Committee member: Conference on Integer Programming and Combinatorial Optimization - IPCO 2017
Committee member: ACM-SIAM Symposium on Discrete Algorithms - SODA 2019
Committee member: Mixed Integer Programming Workshop - MIP 2019
Committee member: Conference on Integer Programming and Combinatorial Optimization - IPCO 2020
Committee member: European Symposium on Algorithms - ESA 2020
Committee member: ACM-SIAM Symposium on Discrete Algorithms - SODA 2022
Committee member: Open Competition ENW Klein - 08 - Cluster A
Committee member: Symposium on Foundations of Computer Science - FOCS 2022
Board Member: Lorentz Center: Mathematics Scientific Advisory Board
Editor: Associate Editor: Mathematics of Operations Research
Committee member: Open Competition ENW-M 21-4
Professor: Professor of Geometry of Optimization at Utrecht University

Veni Innovational Research Grant NWO (2015)

Towards a Quantitative Theory of Integer Programming (QIP)

Continuous Optimization(1 Oct 2023 - 1 Dec 2023)

Daniel Dadush

Publications

Awards

Professional activities

Grants

Current projects with external funding

Courses

Daniel Dadush

Publications

Awards

Professional activities

Grants

Current projects with external funding

Courses

Cookies