default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVineet Goyal
Person information
- affiliation: Columbia University, New York City, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Antoine Désir, Vineet Goyal
, Bo Jiang, Tian Xie, Jiawei Zhang:
Robust Assortment Optimization Under the Markov Chain Choice Model. Oper. Res. 72(4): 1595-1614 (2024)- [j32]Omar El Housni, Ayoub Foussoul, Vineet Goyal:
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization. Math. Program. 206(1): 239-281 (2024) - [j31]Omar Besbes, Vineet Goyal, Garud Iyengar, Raghav Singal:
Workforce Scheduling with Heterogeneous Time Preferences: Effective Wages and Workers' Supply. Manuf. Serv. Oper. Manag. 26(5): 1768-1786 (2024) - [c24]Ayoub Foussoul, Vineet Goyal, Amit Kumar:
Fully-Dynamic Load Balancing. IPCO 2024: 182-195 - 2023
- [j30]Vineet Goyal, Julien Grand-Clément:
A First-Order Approach to Accelerated Value Iteration. Oper. Res. 71(2): 517-535 (2023) - [j29]Vineet Goyal, Rajan Udwani:
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation. Oper. Res. 71(2): 563-580 (2023) - [j28]Julien Grand-Clément, Carri W. Chan, Vineet Goyal, Gabriel J. Escobar:
Robustness of Proactive Intensive Care Unit Transfer Policies. Oper. Res. 71(5): 1653-1688 (2023) - [j27]Vineet Goyal, Julien Grand-Clément:
Robust Markov Decision Processes: Beyond Rectangularity. Math. Oper. Res. 48(1): 203-226 (2023) - [c23]Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi:
Last Switch Dependent Bandits with Monotone Payoff Functions. ICML 2023: 10265-10284 - [i13]Ayoub Foussoul, Vineet Goyal, Varun Gupta:
MNL-Bandit in non-stationary environments. CoRR abs/2303.02504 (2023) - [i12]Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi:
Last Switch Dependent Bandits with Monotone Payoff Functions. CoRR abs/2306.00338 (2023) - [i11]Vineet Goyal, Salal Humair, Orestis Papadigenopoulos, Assaf Zeevi:
MNL-Prophet: Sequential Assortment Selection under Uncertainty. CoRR abs/2308.05207 (2023) - 2022
- [j26]Antoine Désir, Vineet Goyal, Jiawei Zhang:
Technical Note - Capacitated Assortment Optimization: Hardness and Approximation. Oper. Res. 70(2): 893-904 (2022) - [j25]Xiao-Yue Gong, Vineet Goyal, Garud N. Iyengar, David Simchi-Levi, Rajan Udwani, Shuangyu Wang:
Online Assortment Optimization with Reusable Resources. Manag. Sci. 68(7): 4772-4785 (2022) - [j24]Raghav Singal, Omar Besbes, Antoine Désir, Vineet Goyal, Garud Iyengar:
Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising. Manag. Sci. 68(10): 7457-7479 (2022) - [c22]Omar El Housni, Ayoub Foussoul, Vineet Goyal:
LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization. IPCO 2022: 223-236 - [c21]Noémie Périvier, Vineet Goyal:
Dynamic pricing and assortment under a contextual MNL demand. NeurIPS 2022 - [c20]Adam N. Elmachtoub, Vineet Goyal, Roger Lederman, Harsh Sheth:
Revenue Management with Product Retirement and Customer Selection. WINE 2022: 358 - 2021
- [j23]Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev:
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice. Oper. Res. 69(4): 1206-1227 (2021) - [j22]Omar El Housni, Vineet Goyal:
On the Optimality of Affine Policies for Budgeted Uncertainty Sets. Math. Oper. Res. 46(2): 674-711 (2021) - [c19]Omar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein:
Matching Drivers to Riders: A Two-Stage Robust Approach. APPROX-RANDOM 2021: 12:1-12:22 - [c18]Omar El Housni, Vineet Goyal, David B. Shmoys:
On the Power of Static Assignment Policies for Robust Facility Location Problems. IPCO 2021: 252-267 - [c17]Abdellah Aznag, Vineet Goyal, Noémie Périvier:
MNL-Bandit with Knapsacks. EC 2021: 125-126 - [c16]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources. WINE 2021: 543 - [i10]Abdellah Aznag, Vineet Goyal, Noémie Périvier:
MNL-Bandit with Knapsacks. CoRR abs/2106.01135 (2021) - [i9]Vineet Goyal, Noémie Périvier:
Dynamic pricing and assortment under a contextual MNL demand. CoRR abs/2110.10018 (2021) - [i8]Julien Grand-Clément, Carri W. Chan, Vineet Goyal, Elizabeth Chuang:
Interpretable Machine Learning for Resource Allocation with Application to Ventilator Triage. CoRR abs/2110.10994 (2021) - 2020
- [j21]Antoine Désir, Vineet Goyal, Danny Segev, Chun Ye:
Constrained Assortment Optimization Under the Markov Chain-based Choice Model. Manag. Sci. 66(2): 698-721 (2020) - [j20]Aharon Ben-Tal, Omar El Housni, Vineet Goyal:
A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization. Math. Program. 182(1): 57-102 (2020) - [c15]Vineet Goyal, Rajan Udwani:
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation. EC 2020: 791 - [i7]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio. CoRR abs/2002.02430 (2020) - [i6]Julien Grand-Clément, Carri W. Chan, Vineet Goyal, Gabriel J. Escobar:
Robust Policies For Proactive ICU Transfers. CoRR abs/2002.06247 (2020) - [i5]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations. CoRR abs/2010.03983 (2020)
2010 – 2019
- 2019
- [j19]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. Oper. Res. 67(5): 1453-1485 (2019) - [j18]Pranjal Awasthi, Vineet Goyal, Brian Y. Lu:
On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints. Math. Program. 173(1-2): 313-352 (2019) - [c14]Omar Besbes, Antoine Désir, Vineet Goyal, Garud Iyengar, Raghav Singal:
Shapley Meets Uniform: An Axiomatic Framework for Attribution in Online Advertising. WWW 2019: 1713-1723 - [i4]Vineet Goyal, Rajan Udwani:
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation. CoRR abs/1905.12778 (2019) - [i3]Kumar Goutam, Vineet Goyal, Agathe Soret:
A Generalized Markov Chain Model to Capture Dynamic Preferences and Choice Overload. CoRR abs/1911.06716 (2019) - 2018
- [j17]Omar El Housni, Vineet Goyal:
Piecewise static policies for two-stage adjustable robust linear optimization. Math. Program. 169(2): 649-665 (2018) - 2017
- [c13]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the MNL-Bandit. COLT 2017: 76-78 - [c12]Omar El Housni, Vineet Goyal:
Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization. NIPS 2017: 4756-4764 - [i2]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the MNL-Bandit. CoRR abs/1706.00977 (2017) - [i1]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. CoRR abs/1706.03880 (2017) - 2016
- [j16]Vineet Goyal, Retsef Levi, Danny Segev:
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. Oper. Res. 64(1): 219-235 (2016) - [j15]Antoine Désir, Vineet Goyal, Yehua Wei, Jiawei Zhang:
Sparse Process Flexibility Designs: Is the Long Chain Really Optimal? Oper. Res. 64(2): 416-431 (2016) - [j14]Jose H. Blanchet, Guillermo Gallego, Vineet Goyal:
A Markov Chain Approximation to Choice Modeling. Oper. Res. 64(4): 886-905 (2016) - [j13]Vashist Avadhanula, Jalaj Bhandari, Vineet Goyal, Assaf Zeevi:
On the tightness of an LP relaxation for rational optimization and its applications. Oper. Res. Lett. 44(5): 612-617 (2016) - [c11]Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev:
Assortment Optimization Under the Mallows model. NIPS 2016: 4700-4708 - [c10]Antoine Désir, Vineet Goyal, Danny Segev:
Assortment Optimization under a Random Swap based Distribution over Permutations Model. EC 2016: 341-342 - [c9]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection. EC 2016: 599-600 - 2015
- [j12]Daniel Golovin, Vineet Goyal, Valentin Polishchuk, R. Ravi, Mikko Sysikaski:
Improved approximations for two-stage min-cut and shortest path problems under uncertainty. Math. Program. 149(1-2): 167-194 (2015) - [j11]Dimitris Bertsimas, Vineet Goyal, Brian Y. Lu:
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. Math. Program. 150(2): 281-319 (2015) - 2014
- [c8]Vineet Goyal, Garud Iyengar, Quique Schwarz, Shuangyu Wang:
Optimal price rebates for demand response under power flow constraints. SmartGridComm 2014: 626-631 - 2013
- [j10]Dimitris Bertsimas, Vineet Goyal:
On the approximability of adjustable robust convex optimization under uncertainty. Math. Methods Oper. Res. 77(3): 323-343 (2013) - [j9]Vineet Goyal, R. Ravi:
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. Oper. Res. Lett. 41(2): 191-196 (2013) - [c7]Vineet Goyal, Garud Iyengar, Zhen Qiu:
Near-optimal execution policies for demand-response contracts in electricity markets. CDC 2013: 3697-3702 - [c6]Jose H. Blanchet, Guillermo Gallego, Vineet Goyal:
A markov chain approximation to choice modeling. EC 2013: 103-104 - 2012
- [j8]Dimitris Bertsimas, Vineet Goyal:
On the power and limitations of affine policies in two-stage adaptive optimization. Math. Program. 134(2): 491-531 (2012) - [j7]Vineet Goyal, Karl Sigman:
On simulating a class of Bernstein polynomials. ACM Trans. Model. Comput. Simul. 22(2): 12:1-12:5 (2012) - 2011
- [j6]Dimitris Bertsimas, Vineet Goyal, Xu Andy Sun:
A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization. Math. Oper. Res. 36(1): 24-54 (2011) - [j5]Vineet Goyal, Latife Genç Kaya, R. Ravi:
An FPTAS for minimizing the product of two non-negative linear cost functions. Math. Program. 126(2): 401-405 (2011) - 2010
- [j4]Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. 35(1): 79-101 (2010) - [j3]Dimitris Bertsimas, Vineet Goyal:
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems. Math. Oper. Res. 35(2): 284-305 (2010) - [j2]Anureet Saxena, Vineet Goyal, Miguel A. Lejeune:
MIP reformulations of the probabilistic set covering problem. Math. Program. 121(1): 1-31 (2010) - [j1]Vineet Goyal, R. Ravi:
A PTAS for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3): 161-164 (2010)
2000 – 2009
- 2008
- [c5]Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A plant location guide for the unsure. SODA 2008: 1164-1173 - 2007
- [c4]Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi:
Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509 - 2006
- [c3]Daniel Golovin, Vineet Goyal, R. Ravi:
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. STACS 2006: 206-217 - 2005
- [c2]Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh:
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. FOCS 2005: 367-378 - 2004
- [c1]Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh:
On the Crossing Spanning Tree Problem. APPROX-RANDOM 2004: 51-60
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
