Center for Mathematical and Computational Sciences, Institute for Basic Science (IBS)
Office: B213, Theory Building E-mail: dabeenl [at] ibs [dot] re [dot] kr
I am a post-doctoral researcher in the Discrete Mathematics Group at the Institute for Basic Science (IBS), South Korea. I am a recipient of the IBS Young Scientist Fellowship, awarded by the IBS. I obtained my Ph.D. in the Algorithms, Combinatorics, and Optimization (ACO) program at the Tepper School of Business, Carnegie Mellon University. I am very fortunate to be advised by Gérard Cornuéjols.
I am interested in broad areas of optimization with more focus on discrete and combinatorial optimization. Recently, I have been working on developing discrete and combinatorial optimization techniques for solving stochastic and data-driven optimization problems. Some of my latest projects span topics including mathematical programming and algorithmic approaches for integer, stochastic, and robust optimization.
Test score algorithms for budgeted stochastic utility maximization, with Milan Vojnovic and Se-Young Yun, December 2020, submitted.
Conic mixed-binary sets: convex hull characterizations and applications, with Fatma Kılınç-Karzan and Simge Küçükyavuz, December 2020, submitted.
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, July 2020, submitted.
On a generalization of the Chvátal-Gomory closure, with Sanjeeb Dash and Oktay Günlük, June 2020, submitted.
Extended abstract appeared in Integer Programming and Combinatorial Optimization (IPCO 2020), LNCS 12125 (2020) 117-129 (pdf)
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, with Fatma Kılınç-Karzan and Simge Küçükyavuz, October 2019, submitted.
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, to appear.
Idealness of k-wise intersecting families, with Ahmad Abdi, Gérard Cornuéjols, and Tony Huynh,
Mathematical Programming, to appear (https://link.springer.com/article/10.1007/s10107-020-01587-x).
Extended abstract appeared in Integer Programming and Combinatorial Optimization (IPCO 2020), 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, to appear (https://link.springer.com/article/10.1007/s10107-020-01539-5).
Resistant sets in the unit hypercube, with Ahmad Abdi and Gérard Cornuéjols.
Mathematics of Operations Research, to appear (https://pubsonline.informs.org/doi/10.1287/moor.2019.1048).
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.
Integer Programming and Combinatorial Optimization (IPCO 2019), 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.
Extended abstract appeared in Integer Programming and Combinatorial Optimization (IPCO 2016), LNCS 9682 (2016) 300–311 (pdf).