14 citations · 23 across the 9 of their papers we have counts for
12 papers
From coordinate subspaces over finite fields to ideal multipartite uniform clutters
Ahmad Abdi, Dabeen Lee
Take a prime power , an integer , and a coordinate subspace over the Galois field . One can associate with an -partite -uniform cl…
Online Resource Allocation in Episodic Markov Decision Processes
Duksang Lee, William Overman, Dabeen Lee
This paper studies a long-term resource allocation problem over multiple periods where each period requires a multi-stage decision-making process. We formulate the problem as an on…
Online Convex Optimization with Stochastic Constraints: Zero Constraint Violation and Bandit Feedback
Yeongjong Kim, Dabeen Lee
This paper studies online convex optimization with stochastic constraints. We propose a variant of the drift-plus-penalty algorithm that guarantees expected regret an…
Non-Smooth, Hölder-Smooth, and Robust Submodular Maximization
Duksang Lee, Nam Ho-Nguyen, Dabeen Lee
We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an $[(1-1/e)\OPT-ε]$ g…
Scheduling Jobs with Stochastic Holding Costs
Dabeen Lee, Milan Vojnovic
We study a single-server scheduling problem for the objective of minimizing the expected cumulative holding cost incurred by jobs, where parameters defining stochastic job holding…
Test Score Algorithms for Budgeted Stochastic Utility Maximization
Dabeen Lee, Milan Vojnovic, Se-Young Yun
Motivated by recent developments in designing algorithms based on individual item scores for solving utility maximization problems, we study the framework of using test scores, def…
Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee +1
We consider a general conic mixed-binary set where each homogeneous conic constraint involves an affine function of independent continuous variables and an epigraph variable as…
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty under Wasserstein Ambiguity
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz +1
Distributionally robust chance-constrained programs (DR-CCP) over Wasserstein ambiguity sets exhibit attractive out-of-sample performance and admit big--based mixed-integer prog…
On a generalization of the Chvatal-Gomory closure
Sanjeeb Dash, Oktay Gunluk, Dabeen Lee
Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (2012) considered a strengthened version of Chvatal-Gomory (CG) inequa…
Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty under Wasserstein Ambiguity
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz +1
We consider exact deterministic mixed-integer programming (MIP) reformulations of distributionally robust chance-constrained programs (DR-CCP) with random right-hand sides over Was…
Idealness of -wise intersecting families
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh +1
A clutter is \emph{-wise intersecting} if every members have a common element, yet no element belongs to all members. We conjecture that, for some integer , every $…
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee
A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets w…