default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSumit Kunnumkal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Sumit Kunnumkal
:
Technical Note - New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model. Oper. Res. 71(4): 1112-1119 (2023)- 2022
- [j14]Víctor Martínez-de-Albéniz, Sumit Kunnumkal:
A Model for Integrated Inventory and Assortment Planning. Manag. Sci. 68(7): 5049-5067 (2022)
2010 – 2019
- 2019
- [j13]Sumit Kunnumkal, Kalyan T. Talluri:
A strong Lagrangian relaxation for general discrete-choice network revenue management. Comput. Optim. Appl. 73(1): 275-310 (2019) - [j12]Sumit Kunnumkal, Víctor Martínez-de-Albéniz:
Tractable Approximations for Assortment Planning with Product Costs. Oper. Res. 67(2): 436-452 (2019) - [j11]Sumit Kunnumkal, Kalyan T. Talluri:
Choice Network Revenue Management Based on New Tractable Approximations. Transp. Sci. 53(6): 1591-1608 (2019) - 2016
- [j10]Sumit Kunnumkal, Kalyan T. Talluri:
Technical Note - A Note on Relaxations of the Choice Network Revenue Management Dynamic Program. Oper. Res. 64(1): 158-166 (2016) - [j9]Sumit Kunnumkal, Kalyan T. Talluri:
On a Piecewise-Linear Approximation for Network Revenue Management. Math. Oper. Res. 41(1): 72-91 (2016) - 2015
- [j8]Sumit Kunnumkal:
On upper bounds for assortment optimization under the mixture of multinomial logit models. Oper. Res. Lett. 43(2): 189-194 (2015) - 2012
- [j7]Sumit Kunnumkal, Kalyan T. Talluri, Huseyin Topaloglu:
A Randomized Linear Programming Method for Network Revenue Management with Product-Specific No-Shows. Transp. Sci. 46(1): 90-108 (2012) - 2011
- [j6]Sumit Kunnumkal, Huseyin Topaloglu:
Linear programming based decomposition methods for inventory distribution systems. Eur. J. Oper. Res. 211(2): 282-297 (2011) - 2010
- [j5]Sumit Kunnumkal, Huseyin Topaloglu:
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm. ACM Trans. Model. Comput. Simul. 20(3): 12:1-12:26 (2010) - [j4]Sumit Kunnumkal, Huseyin Topaloglu:
Computing Time-Dependent Bid Prices in Network Revenue Management Problems. Transp. Sci. 44(1): 38-62 (2010) - [c1]Sumit Kunnumkal, Huseyin Topaloglu:
Simulation-based methods for booking control in network revenue management. WSC 2010: 1890-1897
2000 – 2009
- 2009
- [j3]Sumit Kunnumkal, Huseyin Topaloglu:
A stochastic approximation method for the single-leg revenue management problem with discrete demand distributions. Math. Methods Oper. Res. 70(3): 477-504 (2009) - 2008
- [j2]Sumit Kunnumkal, Huseyin Topaloglu:
Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm. INFORMS J. Comput. 20(2): 288-301 (2008) - [j1]Sumit Kunnumkal, Huseyin Topaloglu:
Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems. Oper. Res. 56(3): 646-664 (2008)
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-04-24 22:59 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:
