Dabeen Lee

CoRR, 2024

Reinforcement Learning for Infinite-Horizon Average-Reward MDPs with Multinomial Logistic Function Approximation.

[BibT_eX]

[DOI]

Jaehyun Park

CoRR, 2024

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity.

[BibT_eX]

[DOI]

INFORMS J. Optim., April, 2023

Test Score Algorithms for Budgeted Stochastic Utility Maximization.

[BibT_eX]

[DOI]

Milan Vojnovic

Se-Young Yun

INFORMS J. Optim., January, 2023

Stochastic-Constrained Stochastic Optimization with Markovian Data.

[BibT_eX]

[DOI]

Yeongjong Kim

CoRR, 2023

Online Resource Allocation in Episodic Markov Decision Processes.

[BibT_eX]

[DOI]

Duksang Lee

CoRR, 2023

Projection-Free Online Convex Optimization with Stochastic Constraints.

[BibT_eX]

[DOI]

Duksang Lee

Nam Ho-Nguyen

CoRR, 2023

2022

Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens.

[BibT_eX]

[DOI]

Fatma Kilinç-Karzan

Simge Küçükyavuz

Math. Program., 2022

Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity.

[BibT_eX]

[DOI]

Math. Program., 2022

On a generalization of the Chvátal-Gomory closure.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2022

Correction to: Idealness of k-wise intersecting families.

[BibT_eX]

[DOI]

Math. Program., 2022

Idealness of k-wise intersecting families.

[BibT_eX]

[DOI]

Math. Program., 2022

Non-smooth and Hölder-smooth Submodular Maximization.

[BibT_eX]

[DOI]

Duksang Lee

Nam Ho-Nguyen

CoRR, 2022

2021

Generalized Chvátal-Gomory closures for integer programs with bounds on variables.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2021

Resistant Sets in the Unit Hypercube.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Learning to Schedule.

[BibT_eX]

[DOI]

Milan Vojnovic

CoRR, 2021

Scheduling jobs with stochastic holding costs.

[BibT_eX]

[DOI]

Milan Vojnovic

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

On the Rational Polytopes with Chvátal Rank 1.

[BibT_eX]

[DOI]

Yanjun Li

Math. Program., 2020

Cuboids, a class of clutters.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Intersecting Restrictions in Clutters.

[BibT_eX]

[DOI]

Comb., 2020

2019

Deltas, extended odd holes and their blockers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0, 1 hypercube.

[BibT_eX]

[DOI]

Discret. Optim., 2019

Identically Self-blocking Clutters.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Paved and Unpaved Road Segmentation Using Deep Neural Network.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition, 2019

2018

On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank.

[BibT_eX]

[DOI]