On the approximability of adjustable robust convex optimization under uncertainty

von Bertsimas, Dimitris
Veröffentlicht in Mathematical methods of operations research (2013)

An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set

von Goyal, Vineet
Veröffentlicht in Operations research letters (2013)

Dynamic pricing and assortment under a contextual MNL demand

von Perivier, Noemie
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 5 of 50 (2023)

A PTAS for the chance-constrained knapsack problem with random item sizes

von Goyal, Vineet
Veröffentlicht in Operations research letters (2010)

On the power of robust solutions in two-stage stochastic and adaptive optimization problems

von Bertsimas, Dimitris
Veröffentlicht in Mathematics of operations research (2010)

On the optimality of affine policies for budgeted uncertainty sets

von El Housni, Omar
Veröffentlicht in Mathematics of operations research (2021)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources

von Goyal, Vineet
Veröffentlicht in WINE (17. : 2021 : Online) Web and Internet Economics (2022)

A Markov chain approximation to choice modeling

von Blanchet, Jose
Veröffentlicht in Operations research (-2016)

Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand

von Goyal, Vineet
Veröffentlicht in Operations research (-2016)

A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization

von Bertsimas, Dimitris
Veröffentlicht in Mathematics of operations research (2011)

On the Power of Static Assignment Policies for Robust Facility Location Problems

von Housni, Omar EI
Veröffentlicht in IPCO (22. : 2021 : Online) Integer programming and combinatorial optimization (2021)

LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization

von Housni, Omar El
Veröffentlicht in IPCO (23. : 2022 : Eindhoven) Integer programming and combinatorial optimization (2022)

A plant location guide for the unsure : approximation algorithms for min-max location problems

Veröffentlicht in Mathematics of operations research (2010)

Mallows-smoothed distribution over rankings approach for modeling choice

von Désir, Antoine
Veröffentlicht in Operations research (2021)

MNL-Bandit : a dynamic learning approach to assortment selection

von Agrawal, Shipra
Veröffentlicht in Operations research (2019)

On the tightness of an LP relaxation for rational optimization and its applications

von Avadhanula, Vashist
Veröffentlicht in Operations research letters (2016)

Sparse process flexibility designs : is the long chain really optimal?

von Désir, Antoine
Veröffentlicht in Operations research (-2016)

Constrained assortment optimization under the Markov chain-based choice model

von Désir, Antoine
Veröffentlicht in Management science (2020)