Assistant Professor, Industrial and Systems Engineering, KAIST
Office: 2109 E2-2 E-mail: dabeenl [at] kaist [dot] ac [dot] kr Tel: +82-42-350-3113 (042-350-3113)
I am an assistant professor in the Department of Industrial and Systems Engineering (ISysE) at the Korea Advanced Institute of Science and Technology (KAIST). Previously, I was a post-doc in the Discrete Mathematics Group at the Institute for Basic Science (IBS), hosted by Sang-il Oum, and a recipient of the IBS Young Scientist Fellowship (YSF).
I obtained my Ph.D. in the Algorithms, Combinatorics, and Optimization (ACO) program at the Tepper School of Business, Carnegie Mellon University, advised by Gérard Cornuéjols. My thesis won the Gerald L. Thompson Doctoral Dissertation Award for the best Ph.D. thesis in the area of management Science, and I was supported by Henry J. Gailliot Presidential Fellowship. A part of my thesis received Second Place in the INFORMS Optimization Society Best Student Paper Prize Competition 2019.
I am interested in a broad area of optimization spanning discrete and combinatorial optimization, stochastic, robust, and distributionally robust optimization, submodular optimization, and optimization algorithms. Recently, I have been working on developing optimization methods for solving stochastic and data-driven decision-making problems. I am also interested in algorithms for online decision-making, such as multi-armed bandits, online scheduling, and online stochastic/convex optimization. Some of my latest projects span topics including distributionally robust chance-constrained programming, memory-efficient algorithms for submodular maximization, and learning algorithms for scheduling under uncertainty.
IE331 Operations Research: Optimization
IE631 Integer Programming
IE539 Convex Optimization
Duksang Lee (2023 - )
Jaehyun Park (ISySE, 2023 - )
Junyeop Kwon (ISySE, 2023 - )
Online resource allocation in episodic Markov decision processes with Duksang Lee, May 2023.
Projection-free online convex optimization with stochastic constraints with Nam Ho-Nguyen and Duksang Lee, May 2023.
Online convex optimization with stochastic constraints: zero constraint violation and bandit feedback with Yeongjong Kim, January 2023.
Non-smooth and Hölder-smooth submodular maximization with Nam Ho-Nguyen and Duksang Lee, October 2022.
Scheduling jobs with stochastic holding costs with Milan Vojnovic, September 2022. Some preliminary results appeared in NeurIPS 2021 (Advances in Neural Information Processing Systems) 34 (2021) 19375-19384 (pdf)
Conic mixed-binary sets: convex hull characterizations and applications with Fatma Kılınç-Karzan, Simge Küçükyavuz, and Soroosh Shafieezadeh-Abadeh. Operations Research, to appear
Strong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity with Nam Ho-Nguyen, Fatma Kılınç-Karzan and Simge Küçükyavuz. INFORMS Journal on Optimization, published online (link)
Test score algorithms for budgeted stochastic utility maximization with Milan Vojnovic and Se-Young Yun. INFORMS Journal on Optimization 5(1) (2023) 27-67.
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity with Nam Ho-Nguyen, Fatma Kılınç-Karzan and Simge Küçükyavuz. Mathematical Programming 196 (2022) 641-672.
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens with Fatma Kılınç-Karzan and Simge Küçükyavuz. Mathematical Programming 195 (2022) 283-326.
On a generalization of the Chvátal-Gomory closure with Sanjeeb Dash and Oktay Günlük. Mathematical Programming 192 (2022) 149-175. Conference version: IPCO 2020 (Integer Programming and Combinatorial Optimization), LNCS 12125 (2020) 117-129 (pdf).
Idealness of k-wise intersecting families with Ahmad Abdi, Gérard Cornuéjols, and Tony Huynh. Mathematical Programming 192 (2022) 29-50 (Erratum: link). Conference version: IPCO 2020 (Integer Programming and Combinatorial Optimization), LNCS 12125 (2020) 1-12 (pdf).
Generalized Chvátal-Gomory closures for integer programs with bounds on variables with Sanjeeb Dash and Oktay Günlük. Mathematical Programming 190 (2021) 393-425.
Resistant sets in the unit hypercube with Ahmad Abdi and Gérard Cornuéjols. Mathematics of Operations Research 46 (2021) 82-114.
Intersecting restrictions in clutters with Ahmad Abdi and Gérard Cornuéjols. Combinatorica 40 (2020) 605-623.
Cuboids, a class of clutters with Ahmad Abdi, Gérard Cornuéjols, and Natália Guričanová. Journal of Combinatorial Theory B 142 (2020) 144-209.
On the rational polytopes with Chvátal rank 1 with Gérard Cornuéjols and Yanjun Li. Mathematical Programming 179 (2020) 21-46.
Identically self-blocking clutters with Ahmad Abdi and Gérard Cornuéjols. IPCO 2019 (Integer Programming and Combinatorial Optimization), LNCS 11480 (2019) 1-12.
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube. Discrete Optimization 32 (2019) 11-18.
Deltas, extended odd holes and their blockers with Ahmad Abdi. Journal of Combinatorial Theory B 136 (2019) 193-203.
On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank with Gérard Cornuéjols. Mathematical Programming 172 (2018) 467-503. Conference version: IPCO 2016 (Integer Programming and Combinatorial Optimization), LNCS 9682 (2016) 300-311 (pdf).
Ahmad Abdi, Gérard Cornuéjols, Sanjeeb Dash, Oktay Günlük, Natália Guričanová, Nam Ho-Nguyen, Tony Huynh, Fatma Kılınç-Karzan, Yeongjong Kim, Simge Küçükyavuz, Duksang Lee, Yanjun Li, Soroosh Shafieezadeh-Abadeh, Milan Vojnovic, Se-Young Yun