Huseyin Topaloglu
Orcid: 0000-0002-3049-6719Affiliations:
- Cornell University, Ithaca, NY, USA
According to our database1,
Huseyin Topaloglu
authored at least 63 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
3
4
1
2
4
3
3
4
4
5
4
1
4
4
3
3
2
1
1
1
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Manuf. Serv. Oper. Manag., January, 2024
Assortment Optimization Under the Multinomial Logit Model with Utility-Based Rank Cutoffs.
Oper. Res., 2024
Oper. Res., 2024
2023
Manag. Sci., July, 2023
Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments.
Oper. Res., July, 2023
Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models.
Oper. Res., March, 2023
Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals.
Oper. Res., 2023
2022
Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree.
Manuf. Serv. Oper. Manag., 2022
2021
Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints.
Manag. Sci., 2021
Assortment Optimization and Pricing Under the Multinomial Logit Model with Impatient Customers: Sequential Recommendation and Selection.
Oper. Res., 2021
2020
Manag. Sci., 2020
An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals.
Oper. Res., 2020
INFORMS J. Comput., 2020
2019
Oper. Res. Lett., 2019
Oper. Res., 2019
An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking.
INFORMS J. Comput., 2019
2018
Technical Note - Multiproduct Pricing Under the Generalized Extreme Value Models with Homogeneous Price Sensitivity Parameters.
Oper. Res., 2018
Technical Note - An Expectation-Maximization Algorithm to Estimate the Parameters of the Markov Chain Choice Model.
Oper. Res., 2018
Technical Note - Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets.
Oper. Res., 2018
2017
Price competition under linear demand and finite inventories: Contraction and approximate equilibria.
Oper. Res. Lett., 2017
INFORMS J. Comput., 2017
2015
Oper. Res., 2015
Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model.
Oper. Res., 2015
Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds.
INFORMS J. Comput., 2015
2014
Oper. Res., 2014
Oper. Res., 2014
On the Approximate Linear Programming Approach for Network Revenue Management Problems.
INFORMS J. Comput., 2014
2012
Tractable Open Loop Policies for Joint Overbooking and Capacity Control Over a Single Flight Leg with Multiple Fare Classes.
Transp. Sci., 2012
A Randomized Linear Programming Method for Network Revenue Management with Product-Specific No-Shows.
Transp. Sci., 2012
Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model.
Oper. Res., 2012
Proceedings of the Winter Simulation Conference, 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
A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network.
INFORMS J. Comput., 2010
Identifying effective policies in approximate dynamic programming: Beyond regression.
Proceedings of the 2010 Winter Simulation Conference, 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
Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management.
Oper. Res., 2009
A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions.
Eur. J. Oper. Res., 2009
On the asymptotic optimality of the randomized linear program for network revenue management.
Eur. J. Oper. Res., 2009
Proceedings of the 2009 Winter Simulation Conference, 2009
2008
Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems.
Oper. Res., 2008
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems.
INFORMS J. Comput., 2008
Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm.
INFORMS J. Comput., 2008
2007
Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem.
Transp. Sci., 2007
J. Oper. Res. Soc., 2007
Sensitivity Analysis of a Dynamic Fleet Management Model Using Approximate Dynamic Programming.
Oper. Res., 2007
2006
Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems.
INFORMS J. Comput., 2006
Eur. J. Oper. Res., 2006
2005
A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations.
Oper. Res., 2005
Proceedings of the Applications of Stochastic Programming, 2005
2004
Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems.
Math. Oper. Res., 2004
2003
An algorithm for approximating piecewise linear concave functions from sample gradients.
Oper. Res. Lett., 2003
2002
Abstracts for the 2001 Transportation Science Section Dissertation Prize Competition.
Transp. Sci., 2002