Vineet Goyal
Vineet Goyal
Email verificata su ieor.columbia.edu - Home page
Titolo
Citata da
Citata da
Anno
A markov chain approximation to choice modeling
J Blanchet, G Gallego, V Goyal
Operations Research 64 (4), 886-905, 2016
2112016
On the power and limitations of affine policies in two-stage adaptive optimization
D Bertsimas, V Goyal
Mathematical programming 134 (2), 491-531, 2012
1512012
Mnl-bandit: A dynamic learning approach to assortment selection
S Agrawal, V Avadhanula, V Goyal, A Zeevi
Operations Research 67 (5), 1453-1485, 2019
116*2019
Near-optimal algorithms for capacity constrained assortment optimization
A Désir, V Goyal, J Zhang
Available at SSRN 2543309, 2014
1042014
How to pay, come what may: Approximation algorithms for demand-robust covering problems
K Dhamdhere, V Goyal, R Ravi, M Singh
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 367-376, 2005
932005
On the power of robust solutions in two-stage stochastic and adaptive optimization problems
D Bertsimas, V Goyal
Mathematics of Operations Research 35 (2), 284-305, 2010
882010
Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
V Goyal, R Levi, D Segev
Operations Research 64 (1), 219-235, 2016
832016
Thompson sampling for the mnl-bandit
S Agrawal, V Avadhanula, V Goyal, A Zeevi
Conference on Learning Theory, 76-78, 2017
732017
A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization
D Bertsimas, V Goyal, XA Sun
Mathematics of Operations Research 36 (1), 24-54, 2011
702011
MIP reformulations of the probabilistic set covering problem
A Saxena, V Goyal, MA Lejeune
Mathematical programming 121 (1), 1-31, 2010
692010
Capacity constrained assortment optimization under the markov chain based choice model
A Désir, V Goyal, D Segev, C Ye
Available at SSRN 2626484, 2015
67*2015
A PTAS for the chance-constrained knapsack problem with random item sizes
V Goyal, R Ravi
Operations Research Letters 38 (3), 161-164, 2010
532010
Improved approximations for two-stage min-cut and shortest path problems under uncertainty
D Golovin, V Goyal, V Polishchuk, R Ravi, M Sysikaski
Mathematical Programming 149 (1), 167-194, 2015
46*2015
Sparse process flexibility designs: Is the long chain really optimal?
A Désir, V Goyal, Y Wei, J Zhang
Operations Research 64 (2), 416-431, 2016
372016
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
D Bertsimas, V Goyal, BY Lu
Mathematical Programming 150 (2), 281-319, 2015
372015
On the approximability of adjustable robust convex optimization under uncertainty
D Bertsimas, V Goyal
Mathematical Methods of Operations Research 77 (3), 323-343, 2013
352013
A plant location guide for the unsure: Approximation algorithms for min-max location problems
B Anthony, V Goyal, A Gupta, V Nagarajan
Mathematics of Operations Research 35 (1), 79-101, 2010
29*2010
On the crossing spanning tree problem
V Bilo, V Goyal, R Ravi, M Singh
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
292004
Assortment optimization under the mallows model
A Désir, V Goyal, S Jagabathula, D Segev
Advances in Neural Information Processing Systems 29, 4700-4708, 2016
242016
An FPTAS for minimizing the product of two non-negative linear cost functions
V Goyal, L Genc-Kaya, R Ravi
Mathematical programming 126 (2), 401-405, 2011
232011
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20