Vineet Goyal
According to our database1,
Vineet Goyal
authored at least 31 papers
between 2004 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2019
On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints.
Math. Program., 2019
Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising.
Proceedings of the World Wide Web Conference, 2019
2018
Piecewise static policies for two-stage adjustable robust linear optimization.
Math. Program., 2018
2017
Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Thompson Sampling for the MNL-Bandit.
Proceedings of the 30th Conference on Learning Theory, 2017
2016
On the tightness of an LP relaxation for rational optimization and its applications.
Oper. Res. Lett., 2016
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand.
Operations Research, 2016
Sparse Process Flexibility Designs: Is the Long Chain Really Optimal?
Operations Research, 2016
Assortment Optimization under a Random Swap based Distribution over Permutations Model.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
Assortment Optimization Under the Mallows model.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
2015
Improved approximations for two-stage min-cut and shortest path problems under uncertainty.
Math. Program., 2015
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization.
Math. Program., 2015
2014
Optimal price rebates for demand response under power flow constraints.
Proceedings of the 2014 IEEE International Conference on Smart Grid Communications, 2014
2013
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set.
Oper. Res. Lett., 2013
On the approximability of adjustable robust convex optimization under uncertainty.
Math. Meth. of OR, 2013
A markov chain approximation to choice modeling.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
Near-optimal execution policies for demand-response contracts in electricity markets.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013
2012
On simulating a class of Bernstein polynomials.
ACM Trans. Model. Comput. Simul., 2012
On the power and limitations of affine policies in two-stage adaptive optimization.
Math. Program., 2012
2011
An FPTAS for minimizing the product of two non-negative linear cost functions.
Math. Program., 2011
A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization.
Math. Oper. Res., 2011
2010
A PTAS for the chance-constrained knapsack problem with random item sizes.
Oper. Res. Lett., 2010
MIP reformulations of the probabilistic set covering problem.
Math. Program., 2010
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems.
Math. Oper. Res., 2010
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems.
Math. Oper. Res., 2010
2008
A plant location guide for the unsure.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
2007
Pricing Tree Access Networks with Connected Backbones.
Proceedings of the Algorithms, 2007
2006
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
Proceedings of the STACS 2006, 2006
2005
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
On the Crossing Spanning Tree Problem.
Proceedings of the Approximation, 2004