Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Stijn Sackesyn
Daniel P. Kennedy
Dan Graur
Barbara Aquilani
Adhyatmananda Pati
Roland Zumkeller
Maximilian Dürr
Liangliang Shang
Chen Ma
C Scott
Home
/
Author
/
VINEET GOYAL
Author Info
Open Visualization
Name
Affiliation
Papers
VINEET GOYAL
Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA
18
Collaborators
Citations
PageRank
31
156
10.88
Referers
Referees
References
262
237
207
Search Limit
100
262
Publications (18 rows)
Collaborators (31 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
On the Power of Static Assignment Policies for Robust Facility Location Problems
0
0.34
2021
Matching Drivers to Riders - A Two-Stage Robust Approach.
0
0.34
2021
Constrained Assortment Optimization Under the Markov Chain–based Choice Model
0
0.34
2020
On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
3
0.37
2019
Piecewise static policies for two-stage adjustable robust linear optimization.
0
0.34
2018
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
3
0.47
2017
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
9
0.49
2016
Sparse Process Flexibility Designs: Is the Long Chain Really Optimal?
2
0.36
2016
Assortment Optimization under a Random Swap based Distribution over Permutations Model.
1
0.35
2016
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection.
5
0.45
2016
Improved approximations for two-stage min-cut and shortest path problems under uncertainty
1
0.35
2015
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization.
8
0.46
2015
Optimal price rebates for demand response under power flow constraints
0
0.34
2014
A markov chain approximation to choice modeling
8
0.63
2013
On the power and limitations of affine policies in two-stage adaptive optimization.
30
0.94
2012
MIP reformulations of the probabilistic set covering problem
28
2.00
2010
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
22
1.05
2010
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
36
1.26
2005
1