Huseyin Topaloglu

Orcid: 0000-0002-3049-6719

Affiliations:
  • Cornell University, Ithaca, NY, USA


According to our database1, Huseyin Topaloglu authored at least 60 papers between 2002 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Performance Guarantees for Network Revenue Management with Flexible Products.
Manuf. Serv. Oper. Manag., January, 2024

2023
Fluid Approximations for Revenue Management Under High-Variance Demand.
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

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
Dynamic Assortment Optimization for Reusable Products with Random Usage Durations.
Manag. Sci., 2020

Assortment Optimization Under the Paired Combinatorial Logit Model.
Oper. Res., 2020

An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals.
Oper. Res., 2020

Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings.
INFORMS J. Comput., 2020

2019
Assortment optimization under the multinomial logit model with product synergies.
Oper. Res. Lett., 2019

Technical Note - Assortment Optimization with Small Consideration Sets.
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
Delayed Purchase Options in Single-Leg Revenue Management.
Transp. Sci., 2017

Price competition under linear demand and finite inventories: Contraction and approximate equilibria.
Oper. Res. Lett., 2017

Revenue Management Under the Markov Chain Choice Model.
Oper. Res., 2017

Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint.
INFORMS J. Comput., 2017

2015
Assortment optimization over time.
Oper. Res. Lett., 2015

The <i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems.
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
Constrained Assortment Optimization for the Nested Logit Model.
Manag. Sci., 2014

A Bound on the Performance of an Optimal Ambulance Redeployment Policy.
Oper. Res., 2014

Appointment Scheduling Under Patient Preference and No-Show Behavior.
Oper. Res., 2014

Assortment Optimization Under Variants of the Nested Logit Model.
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

Cargo Capacity Management with Allotments and Spot Market Demand.
Oper. Res., 2012

Exploring bounds on ambulance deployment policy performance.
Proceedings of the Winter Simulation Conference, 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

Approximate Dynamic Programming for Ambulance Redeployment.
INFORMS J. Comput., 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

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

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

Ambulance Redeployment: An Approximate Dynamic Programming Approach.
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

Incorporating the pricing decisions into the dynamic fleet management problem.
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

A parallelizable dynamic fleet management model with random travel times.
Eur. J. Oper. Res., 2006

2005
A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations.
Oper. Res., 2005

12. Fleet Management.
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


  Loading...