Zhuan Khye Koh

Full Name

Z.K. Koh

Email

Zhuan.Koh@cwi.nl

Phone

+31 20 592 4386

Room

M237

Department(s)

Networks and Optimization

Function(s)

Researcher

Zhuan Khye Koh

Husić, E., Koh, Z. K., Loho, G., & Végh, L. (2024). On the correlation gap of matroids. Mathematical Programming. doi:10.1007/s10107-024-02116-w
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., 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
Husić, E., Koh, Z. K., Loho, G., & Végh, L. (2023). On the correlation gap of matroids. In Integer Programming and Combinatorial Optimization (pp. 203–216). doi:10.1007/978-3-031-32726-1_15
Dadush, D., Koh, Z. K., Natura, B., & Végh, L. (2021). An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. In Annual European Symposium on Algorithms (pp. 36.1–36.15). doi:10.4230/LIPIcs.ESA.2021.36

Towards a Quantitative Theory of Integer Programming (QIP)