Center for Mathematical and Computational Sciences, Institute for Basic Science
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 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.
Optimization: theory of integer optimization & combinatorial optimization.
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.
Projective geometries, simplices and clutters with Ahmad Abdi, Gérard Cornuéjols, and Matt Superdock, August 2019, submitted.
Generalized Chvátal-Gomory closures for integer programs with bounds on variables with Sanjeeb Dash and Oktay Günlük, June 2019, submitted.
Intersecting restrictions in clutters with Ahmad Abdi and Gérard Cornuéjols, October 2018, submitted.
Resistant sets in the unit hypercube with Ahmad Abdi and Gérard Cornuéjols.
Mathematics of Operations Research, to appear.
Cuboids, a class of clutters with Ahmad Abdi, Gérard Cornuéjols, and Natália Guričanová.
Journal of Combinatorial Theory B, to appear.
On the rational polytopes with Chvátal rank 1 with Gérard Cornuéjols and Yanjun Li.
Mathematical Programming A, to appear.
Identically self-blocking clutters with Ahmad Abdi and Gérard Cornuéjols.
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 IPCO 2016, LNCS 9682 (2016) 300-311 (pdf).