The following pages link to Vineet Goyal (Q623368):
Displaying 36 items.
- An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370) (← links)
- On the power and limitations of affine policies in two-stage adaptive optimization (Q715068) (← links)
- MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- Piecewise static policies for two-stage adjustable robust linear optimization (Q1646580) (← links)
- On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints (Q1717231) (← links)
- On the tightness of an LP relaxation for rational optimization and its applications (Q1755822) (← links)
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set (Q1949686) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
- A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization (Q2191764) (← links)
- A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization (Q2340333) (← links)
- On the approximability of adjustable robust convex optimization under uncertainty (Q2392812) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand (Q2806071) (← links)
- A Markov Chain Approximation to Choice Modeling (Q2830764) (← links)
- A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems (Q3169083) (← links)
- On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems (Q3169094) (← links)
- A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization (Q3169128) (← links)
- Pricing Tree Access Networks with Connected Backbones (Q3527238) (← links)
- (Q3579458) (← links)
- On simulating a class of Bernstein polynomials (Q4635190) (← links)
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets (Q5000650) (← links)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
- Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313046) (← links)
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems (Q5449799) (← links)
- Sparse Process Flexibility Designs: Is the Long Chain Really Optimal? (Q5740219) (← links)
- Matching Drivers to Riders: A Two-Stage Robust Approach (Q6090882) (← links)
- A First-Order Approach to Accelerated Value Iteration (Q6192835) (← links)
- Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation (Q6192837) (← links)
- Robustness of Proactive Intensive Care Unit Transfer Policies (Q6195067) (← links)
- Robust Markov Decision Processes: Beyond Rectangularity (Q6199239) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)
- Robust assortment optimization under the Markov chain choice model (Q6598919) (← links)
