default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalyan T. Talluri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Hanzhao Wang, Yu Pan, Fupeng Sun, Shang Liu, Kalyan T. Talluri, Guanting Chen, Xiaocheng Li:
Understanding the Training and Generalization of Pretrained Transformer for Sequential Decision Making. CoRR abs/2405.14219 (2024)- 2023
- [j23]Kalyan T. Talluri
, Angelos Tsoukalas:
Revenue Management of a Professional Services Firm with Quality Revelation. Oper. Res. 71(4): 1260-1276 (2023) - [j22]Mihalis G. Markakis, Kalyan T. Talluri, Dmitrii Tikhonenko:
Sequential Bidding for Merging in Algorithmic Traffic. Manuf. Serv. Oper. Manag. 25(1): 168-181 (2023) - [i5]Hanzhao Wang, Zhongze Cai, Xiaocheng Li, Kalyan T. Talluri:
A Neural Network Based Choice Model for Assortment Optimization. CoRR abs/2308.05617 (2023) - [i4]Hanzhao Wang, Xiaocheng Li, Kalyan T. Talluri:
Transformer Choice Net: A Transformer Neural Network for Choice Prediction. CoRR abs/2310.08716 (2023) - 2022
- [i3]Hanzhao Wang, Xiaocheng Li, Kalyan T. Talluri:
Learning to Sell a Focal-ancillary Combination. CoRR abs/2207.11545 (2022) - [i2]Zhongze Cai, Hanzhao Wang, Kalyan T. Talluri, Xiaocheng Li:
Deep Learning for Choice Modeling. CoRR abs/2208.09325 (2022) - 2021
- [j21]Ningyuan Chen, Anran Li, Kalyan T. Talluri:
Reviews and Self-Selection Bias with Operational Implications. Manag. Sci. 67(12): 7472-7492 (2021) - [i1]Hanzhao Wang, Kalyan T. Talluri, Xiaocheng Li:
On Dynamic Pricing with Covariates. CoRR abs/2112.13254 (2021)
2010 – 2019
- 2019
- [j20]Sumit Kunnumkal, Kalyan T. Talluri:
A strong Lagrangian relaxation for general discrete-choice network revenue management. Comput. Optim. Appl. 73(1): 275-310 (2019) - [j19]Sumit Kunnumkal, Kalyan T. Talluri:
Choice Network Revenue Management Based on New Tractable Approximations. Transp. Sci. 53(6): 1591-1608 (2019) - 2018
- [j18]Kalyan T. Talluri, Gabriel Y. Weintraub:
Revenue management and market analytics department in management science. SIGecom Exch. 17(1): 37-38 (2018) - 2016
- [j17]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) - [j16]Sumit Kunnumkal, Kalyan T. Talluri:
On a Piecewise-Linear Approximation for Network Revenue Management. Math. Oper. Res. 41(1): 72-91 (2016) - 2014
- [j15]Kalyan T. Talluri:
New Formulations for Choice Network Revenue Management. INFORMS J. Comput. 26(2): 401-413 (2014) - 2012
- [j14]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
- [j13]Víctor Martínez-de-Albéniz, Kalyan T. Talluri:
Dynamic Price Competition with Fixed Capacities. Manag. Sci. 57(6): 1078-1093 (2011)
2000 – 2009
- 2009
- [j12]Kalyan T. Talluri:
The Customer Valuations Game as a Basis for Teaching Revenue Management. INFORMS Trans. Educ. 9(3): 117-123 (2009) - [c2]Kalyan T. Talluri, Itir Z. Karaesmen, Garrett J. van Ryzin, Gustavo J. Vulcano:
Revenue Management: Models and Methods. WSC 2009: 148-161 - 2008
- [c1]Kalyan T. Talluri, Garrett J. van Ryzin, Itir Z. Karaesmen, Gustavo J. Vulcano:
Revenue management: Models and methods. WSC 2008: 145-156 - 2004
- [j11]Kalyan T. Talluri, Garrett J. van Ryzin:
Revenue Management Under a General Discrete Choice Model of Consumer Behavior. Manag. Sci. 50(1): 15-33 (2004) - 2001
- [j10]Kalyan T. Talluri:
Airline revenue management with passenger routing control: a new model with solution approaches. Int. J. Serv. Technol. Manag. 2(1/2): 102-115 (2001)
1990 – 1999
- 1999
- [j9]Kalyan T. Talluri, Garrett J. van Ryzin:
A Randomized Linear Programming Method for Computing Network Bid Prices. Transp. Sci. 33(2): 207-216 (1999) - 1998
- [j8]Ram Gopalan, Kalyan T. Talluri:
Mathematical models in airline schedule planning: A survey. Ann. Oper. Res. 76: 155-185 (1998) - [j7]Ram Gopalan, Kalyan T. Talluri:
The Aircraft Maintenance Routing Problem. Oper. Res. 46(2): 260-271 (1998) - [j6]Kalyan T. Talluri:
The Four-Day Aircraft Maintenance Routing Problem. Transp. Sci. 32(1): 43-53 (1998) - 1996
- [j5]Kalyan T. Talluri:
Network synthesis with few edges. Networks 27(2): 109-115 (1996) - [j4]Kalyan T. Talluri:
Swapping Applications in a Daily Airline Fleet Assignment. Transp. Sci. 30(3): 237-248 (1996) - [j3]Sunil Chopra, Kalyan T. Talluri:
Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks. VLSI Design 4(1): 53-57 (1996) - 1994
- [j2]Kalyan T. Talluri, Donald K. Wagner:
On the k-cut subgraph polytope. Math. Program. 67: 121-132 (1994) - 1991
- [j1]Michel X. Goemans, Kalyan T. Talluri:
2-Change for k-connected networks. Oper. Res. Lett. 10(2): 113-117 (1991)
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-08-05 21:17 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:
