| Publication | Date of Publication | Type |
|---|
Robust assortment optimization under the Markov chain choice model
Operations Research | 2024-09-05 | Paper |
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
A First-Order Approach to Accelerated Value Iteration
Operations Research | 2024-03-12 | Paper |
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation
Operations Research | 2024-03-12 | Paper |
Robustness of Proactive Intensive Care Unit Transfer Policies
Operations Research | 2024-03-12 | Paper |
Robust Markov Decision Processes: Beyond Rectangularity
Mathematics of Operations Research | 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
Operations Research | 2022-05-31 | Paper |
Mallows-smoothed distribution over rankings approach for modeling choice
Operations Research | 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
Mathematics of Operations Research | 2021-07-15 | Paper |
MNL-bandit: a dynamic learning approach to assortment selection
Operations Research | 2020-10-26 | Paper |
A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
Mathematical Programming. Series A. Series B | 2019-02-07 | Paper |
On the tightness of an LP relaxation for rational optimization and its applications
Operations Research Letters | 2019-01-11 | Paper |
Piecewise static policies for two-stage adjustable robust linear optimization
Mathematical Programming. Series A. Series B | 2018-06-25 | Paper |
On simulating a class of Bernstein polynomials
ACM Transactions on Modeling and Computer Simulation | 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
Operations Research | 2016-10-31 | Paper |
Sparse process flexibility designs: Is the long chain really optimal?
Operations Research | 2016-07-25 | Paper |
Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
Operations Research | 2016-05-13 | Paper |
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
On the approximability of adjustable robust convex optimization under uncertainty
Mathematical Methods of Operations Research | 2013-08-02 | Paper |
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
Operations Research Letters | 2013-05-14 | Paper |
On the power and limitations of affine policies in two-stage adaptive optimization
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
A plant location guide for the unsure: approximation algorithms for min-Max location problems
Mathematics of Operations Research | 2011-04-27 | Paper |
A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization
Mathematics of Operations Research | 2011-04-27 | Paper |
On the power of robust solutions in two-stage stochastic and adaptive optimization problems
Mathematics of Operations Research | 2011-04-27 | Paper |
An FPTAS for minimizing the product of two non-negative linear cost functions
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
scientific article; zbMATH DE number 5764865 (Why is no real title available?)
| 2010-08-06 | Paper |
A PTAS for the chance-constrained knapsack problem with random item sizes
Operations Research Letters | 2010-06-08 | Paper |
MIP reformulations of the probabilistic set covering problem
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Pricing Tree Access Networks with Connected Backbones
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
STACS 2006 | 2008-03-19 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
