Sumit Kunnumkal
Orcid: 0000-0002-6832-0508
According to our database1,
Sumit Kunnumkal
authored at least 16 papers
between 2008 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
0
1
2
3
4
1
1
3
2
1
1
1
2
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Technical Note - New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model.
Oper. Res., July, 2023
2022
2019
Transp. Sci., 2019
Oper. Res., 2019
A strong Lagrangian relaxation for general discrete-choice network revenue management.
Comput. Optim. Appl., 2019
2016
Math. Oper. Res., 2016
Technical Note - A Note on Relaxations of the Choice Network Revenue Management Dynamic Program.
Oper. Res., 2016
2015
On upper bounds for assortment optimization under the mixture of multinomial logit models.
Oper. Res. Lett., 2015
2012
A Randomized Linear Programming Method for Network Revenue Management with Product-Specific No-Shows.
Transp. Sci., 2012
2011
Eur. J. Oper. Res., 2011
2010
Transp. Sci., 2010
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm.
ACM Trans. Model. Comput. Simul., 2010
Proceedings of the 2010 Winter Simulation Conference, 2010
2009
A stochastic approximation method for the single-leg revenue management problem with discrete demand distributions.
Math. Methods Oper. Res., 2009
2008
Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems.
Oper. Res., 2008
Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm.
INFORMS J. Comput., 2008