Sumit Kunnumkal

Orcid: 0000-0002-6832-0508

According to our database1, Sumit Kunnumkal authored at least 16 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Technical Note - New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model.
Oper. Res., July, 2023

2022
A Model for Integrated Inventory and Assortment Planning.
Manag. Sci., 2022

2019
Choice Network Revenue Management Based on New Tractable Approximations.
Transp. Sci., 2019

Tractable Approximations for Assortment Planning with Product Costs.
Oper. Res., 2019

A strong Lagrangian relaxation for general discrete-choice network revenue management.
Comput. Optim. Appl., 2019

2016
On a Piecewise-Linear Approximation for Network Revenue Management.
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
Linear programming based decomposition methods for inventory distribution systems.
Eur. J. Oper. Res., 2011

2010
Computing Time-Dependent Bid Prices in Network Revenue Management Problems.
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

Simulation-based methods for booking control in network revenue management.
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


  Loading...