default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuseyin Topaloglu
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j57]Yicheng Bai
, Jacob B. Feldman, Huseyin Topaloglu, Laura Wagner:
Assortment Optimization Under the Multinomial Logit Model with Utility-Based Rank Cutoffs. Oper. Res. 72(4): 1453-1474 (2024)- [j56]Wenchang Zhu, Huseyin Topaloglu:
Performance Guarantees for Network Revenue Management with Flexible Products. Manuf. Serv. Oper. Manag. 26(1): 252-270 (2024) - 2023
- [j55]Yufeng Cao, Paat Rusmevichientong, Huseyin Topaloglu:
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models. Oper. Res. 71(2): 603-625 (2023) - [j54]Omar El Housni, Huseyin Topaloglu:
Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments. Oper. Res. 71(4): 1197-1215 (2023) - [j53]Paat Rusmevichientong, Mika Sumida, Huseyin Topaloglu, Yicheng Bai:
Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals. Oper. Res. 71(6): 2196-2216 (2023) - [j52]Yicheng Bai, Omar El Housni, Billy Jin, Paat Rusmevichientong, Huseyin Topaloglu, David P. Williamson:
Fluid Approximations for Revenue Management Under High-Variance Demand. Manag. Sci. 69(7): 4016-4026 (2023) - 2022
- [j51]Venus Lo, Huseyin Topaloglu:
Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree. Manuf. Serv. Oper. Manag. 24(2): 1220-1240 (2022) - 2021
- [j50]Pin Gao, Yuhang Ma, Ningyuan Chen, Guillermo Gallego, Anran Li, Paat Rusmevichientong, Huseyin Topaloglu:
Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection. Oper. Res. 69(5): 1509-1532 (2021) - [j49]Mika Sumida, Guillermo Gallego, Paat Rusmevichientong, Huseyin Topaloglu, James Davis:
Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints. Manag. Sci. 67(5): 2845-2869 (2021) - 2020
- [j48]Nan Liu, Yuhang Ma, Huseyin Topaloglu:
Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings. INFORMS J. Comput. 32(3): 835-853 (2020) - [j47]Heng Zhang, Paat Rusmevichientong, Huseyin Topaloglu:
Assortment Optimization Under the Paired Combinatorial Logit Model. Oper. Res. 68(3): 741-761 (2020) - [j46]Yuhang Ma, Paat Rusmevichientong, Mika Sumida, Huseyin Topaloglu:
An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals. Oper. Res. 68(3): 834-855 (2020) - [j45]Paat Rusmevichientong, Mika Sumida, Huseyin Topaloglu:
Dynamic Assortment Optimization for Reusable Products with Random Usage Durations. Manag. Sci. 66(7): 2820-2844 (2020) - 2019
- [j44]Mika Sumida, Huseyin Topaloglu:
An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking. INFORMS J. Comput. 31(1): 83-99 (2019) - [j43]Jacob B. Feldman, Alice Paul, Huseyin Topaloglu:
Technical Note - Assortment Optimization with Small Consideration Sets. Oper. Res. 67(5): 1283-1299 (2019) - [j42]Venus Lo, Huseyin Topaloglu:
Assortment optimization under the multinomial logit model with product synergies. Oper. Res. Lett. 47(6): 546-552 (2019) - 2018
- [j41]Jacob B. Feldman, Huseyin Topaloglu:
Technical Note - Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets. Oper. Res. 66(2): 380-391 (2018) - [j40]A. Serdar Simsek, Huseyin Topaloglu:
Technical Note - An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model. Oper. Res. 66(3): 748-760 (2018) - [j39]Heng Zhang, Paat Rusmevichientong, Huseyin Topaloglu:
Technical Note - Multiproduct Pricing Under the Generalized Extreme Value Models with Homogeneous Price Sensitivity Parameters. Oper. Res. 66(6): 1559-1570 (2018) - 2017
- [j38]James M. Davis, Huseyin Topaloglu, David P. Williamson:
Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint. INFORMS J. Comput. 29(1): 54-76 (2017) - [j37]Jacob B. Feldman, Huseyin Topaloglu:
Revenue Management Under the Markov Chain Choice Model. Oper. Res. 65(5): 1322-1342 (2017) - [j36]Jiayang Gao, Krishnamurthy Iyer, Huseyin Topaloglu:
Price competition under linear demand and finite inventories: Contraction and approximate equilibria. Oper. Res. Lett. 45(4): 382-387 (2017) - [j35]Nursen Aydin, S. Ilker Birbil, Huseyin Topaloglu:
Delayed Purchase Options in Single-Leg Revenue Management. Transp. Sci. 51(4): 1031-1045 (2017) - 2015
- [j34]W. Zachary Rayfield, Paat Rusmevichientong, Huseyin Topaloglu:
Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds. INFORMS J. Comput. 27(2): 335-357 (2015) - [j33]Guang Li, Paat Rusmevichientong, Huseyin Topaloglu:
The d-Level Nested Logit Model: Assortment and Price Optimization Problems. Oper. Res. 63(2): 325-342 (2015) - [j32]Jacob B. Feldman, Huseyin Topaloglu:
Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model. Oper. Res. 63(4): 812-822 (2015) - [j31]James M. Davis, Huseyin Topaloglu, David P. Williamson:
Assortment optimization over time. Oper. Res. Lett. 43(6): 608-611 (2015) - 2014
- [j30]Chaoxu Tong, Huseyin Topaloglu:
On the Approximate Linear Programming Approach for Network Revenue Management Problems. INFORMS J. Comput. 26(1): 121-134 (2014) - [j29]James M. Davis, Guillermo Gallego, Huseyin Topaloglu:
Assortment Optimization Under Variants of the Nested Logit Model. Oper. Res. 62(2): 250-273 (2014) - [j28]Jacob B. Feldman, Nan Liu, Huseyin Topaloglu, Serhan Ziya:
Appointment Scheduling Under Patient Preference and No-Show Behavior. Oper. Res. 62(4): 794-811 (2014) - [j27]Matthew S. Maxwell, Eric Cao Ni, Chaoxu Tong, Shane G. Henderson, Huseyin Topaloglu, Susan R. Hunter:
A Bound on the Performance of an Optimal Ambulance Redeployment Policy. Oper. Res. 62(5): 1014-1027 (2014) - [j26]Guillermo Gallego, Huseyin Topaloglu:
Constrained Assortment Optimization for the Nested Logit Model. Manag. Sci. 60(10): 2583-2601 (2014) - 2012
- [j25]Yuri Levin, Mikhail Nediak, Huseyin Topaloglu:
Cargo Capacity Management with Allotments and Spot Market Demand. Oper. Res. 60(2): 351-365 (2012) - [j24]Paat Rusmevichientong, Huseyin Topaloglu:
Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model. Oper. Res. 60(4): 865-882 (2012) - [j23]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) - [j22]Huseyin Topaloglu, S. Ilker Birbil, J. B. G. Frenk, Nilay Noyan:
Tractable Open Loop Policies for Joint Overbooking and Capacity Control Over a Single Flight Leg with Multiple Fare Classes. Transp. Sci. 46(4): 460-481 (2012) - 2011
- [j21]Sumit Kunnumkal, Huseyin Topaloglu:
Linear programming based decomposition methods for inventory distribution systems. Eur. J. Oper. Res. 211(2): 282-297 (2011) - 2010
- [j20]Matthew S. Maxwell, Mateo Restrepo, Shane G. Henderson, Huseyin Topaloglu:
Approximate Dynamic Programming for Ambulance Redeployment. INFORMS J. Comput. 22(2): 266-281 (2010) - [j19]Alexander Erdelyi, Huseyin Topaloglu:
A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network. INFORMS J. Comput. 22(3): 443-456 (2010) - [j18]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) - [j17]Sumit Kunnumkal, Huseyin Topaloglu:
Computing Time-Dependent Bid Prices in Network Revenue Management Problems. Transp. Sci. 44(1): 38-62 (2010) - 2009
- [j16]Huseyin Topaloglu:
On the asymptotic optimality of the randomized linear program for network revenue management. Eur. J. Oper. Res. 197(3): 884-896 (2009) - [j15]Huseyin Topaloglu:
A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions. Eur. J. Oper. Res. 199(2): 315-322 (2009) - [j14]Huseyin Topaloglu:
Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management. Oper. Res. 57(3): 637-649 (2009) - [j13]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
- [j12]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) - [j11]Huseyin Topaloglu:
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems. INFORMS J. Comput. 20(4): 596-610 (2008) - [j10]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) - 2007
- [j9]Huseyin Topaloglu, Warren B. Powell:
Sensitivity Analysis of a Dynamic Fleet Management Model Using Approximate Dynamic Programming. Oper. Res. 55(2): 319-331 (2007) - [j8]G. J. King, Huseyin Topaloglu:
Incorporating the pricing decisions into the dynamic fleet management problem. J. Oper. Res. Soc. 58(8): 1065-1074 (2007) - [j7]Huseyin Topaloglu, Warren B. Powell:
Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem. Transp. Sci. 41(3): 281-301 (2007) - 2006
- [j6]Huseyin Topaloglu:
A parallelizable dynamic fleet management model with random travel times. Eur. J. Oper. Res. 175(2): 782-805 (2006) - [j5]Huseyin Topaloglu, Warren B. Powell:
Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems. INFORMS J. Comput. 18(1): 31-42 (2006) - 2005
- [j4]Huseyin Topaloglu, Warren B. Powell:
A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations. Oper. Res. 53(2): 281-297 (2005) - 2004
- [j3]Warren B. Powell, Andrzej Ruszczynski, Huseyin Topaloglu:
Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems. Math. Oper. Res. 29(4): 814-836 (2004) - 2003
- [j2]Huseyin Topaloglu, Warren B. Powell:
An algorithm for approximating piecewise linear concave functions from sample gradients. Oper. Res. Lett. 31(1): 66-76 (2003) - 2002
- [j1]Ismaïl Chabini, Alan L. Erera, Andrew P. Armacost, Jon Bottom, Sangjin Han, Martin Joborn, Michael Mahut, Qiang Meng, Andrew Schaefer, Karthik Srinivasan, Huseyin Topaloglu, Shane Velan, Ta-Hui Yang:
Abstracts for the 2001 Transportation Science Section Dissertation Prize Competition. Transp. Sci. 36(1): 133-143 (2002)
Conference and Workshop Papers
- 2012
- [c4]Eric Cao Ni, Susan R. Hunter, Shane G. Henderson, Huseyin Topaloglu:
Exploring bounds on ambulance deployment policy performance. WSC 2012: 45:1-45:12 - 2010
- [c3]Matthew S. Maxwell, Shane G. Henderson, Huseyin Topaloglu:
Identifying effective policies in approximate dynamic programming: Beyond regression. WSC 2010: 1079-1087 - [c2]Sumit Kunnumkal, Huseyin Topaloglu:
Simulation-based methods for booking control in network revenue management. WSC 2010: 1890-1897 - 2009
- [c1]Matthew S. Maxwell, Shane G. Henderson, Huseyin Topaloglu:
Ambulance Redeployment: An Approximate Dynamic Programming Approach. WSC 2009: 1850-1860
Parts in Books or Collections
- 2005
- [p1]Warren B. Powell, Huseyin Topaloglu:
12. Fleet Management. Applications of Stochastic Programming 2005: 185-215
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:25 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:
