| Publication | Date of Publication | Type |
|---|
| Robust assortment optimization under the Markov chain choice model | 2024-09-05 | Paper |
| LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization | 2024-08-20 | Paper |
| A First-Order Approach to Accelerated Value Iteration | 2024-03-12 | Paper |
| Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation | 2024-03-12 | Paper |
| Robustness of Proactive Intensive Care Unit Transfer Policies | 2024-03-12 | Paper |
| Robust Markov Decision Processes: Beyond Rectangularity | 2024-02-23 | Paper |
| Matching Drivers to Riders: A Two-Stage Robust Approach | 2023-11-20 | Paper |
| LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization | 2022-08-16 | Paper |
| Technical Note—Capacitated Assortment Optimization: Hardness and Approximation | 2022-05-31 | Paper |
| Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice | 2022-02-16 | Paper |
| On the power of static assignment policies for robust facility location problems | 2021-12-21 | Paper |
| On the Optimality of Affine Policies for Budgeted Uncertainty Sets | 2021-07-15 | Paper |
| MNL-Bandit: A Dynamic Learning Approach to Assortment Selection | 2020-10-26 | Paper |
| A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization | 2020-06-26 | Paper |
| On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints | 2019-02-07 | Paper |
| On the tightness of an LP relaxation for rational optimization and its applications | 2019-01-11 | Paper |
| Piecewise static policies for two-stage adjustable robust linear optimization | 2018-06-25 | Paper |
| On simulating a class of Bernstein polynomials | 2018-04-16 | Paper |
| Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization | 2017-06-18 | Paper |
| A Markov chain approximation to choice modeling | 2016-10-31 | Paper |
| Sparse Process Flexibility Designs: Is the Long Chain Really Optimal? | 2016-07-25 | Paper |
| Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand | 2016-05-13 | Paper |
| A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization | 2015-04-16 | Paper |
| Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty | 2015-02-09 | Paper |
| On the approximability of adjustable robust convex optimization under uncertainty | 2013-08-02 | Paper |
| An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set | 2013-05-14 | Paper |
| On the power and limitations of affine policies in two-stage adaptive optimization | 2012-10-15 | Paper |
| A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems | 2011-04-27 | Paper |
| A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization | 2011-04-27 | Paper |
| On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems | 2011-04-27 | Paper |
| An FPTAS for minimizing the product of two non-negative linear cost functions | 2011-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579458 | 2010-08-06 | Paper |
| A PTAS for the chance-constrained knapsack problem with random item sizes | 2010-06-08 | Paper |
| MIP reformulations of the probabilistic set covering problem | 2010-02-19 | Paper |
| Pricing Tree Access Networks with Connected Backbones | 2008-09-25 | Paper |
| Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems | 2008-03-19 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
