Topaloglu, Huseyin - School of Operations Research and Industrial Engineering, Cornell University

• Computation and Dynamic Programming Huseyin Topaloglu
• Approximate Dynamic Programming for Dynamic Capacity Allocation with Multiple Priority Levels
• Linear Programming Based Decomposition Methods for Inventory Distribution Systems
• A Stochastic Approximation Algorithm for Making Pricing Decisions in Network Revenue Management Problems
• Using Decomposition Methods to Solve Pricing Problems in Network Revenue Management
• A New Dynamic Programming Decomposition Method for the Network Revenue Management Problem with Customer Choice Behavior
• Computing Time-Dependent Bid-Prices in Network Revenue Management Problems
• A Stochastic Approximation Method with Max-Norm Projections and its Applications to the Q-Learning Algorithm
• Erlang Loss Models for the Static Deployment of Ambulances Mateo Restrepo 1
• On the Asymptotic Optimality of the Randomized Linear Program for Network Revenue Management
• Separable Approximations for Joint Capacity Control and Overbooking Decisions in Network Revenue Management
• Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems
• Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem
• An Approximate Dynamic Programming Approach for a Product Distribution Problem
• Transportation Resource Management Sumit Kunnumkal
• A Parallelizable and Approximate Dynamic Programming-Based Dynamic Fleet Management Model with
• STOCHASTIC PROGRAMMING IN TRANSPORTATION AND WARREN B. POWELL AND HUSEYIN TOPALOGLU
• Cargo Capacity Management with Allotments and Spot Market Demand
• Technical Note: Robust Logit Assortments Paat Rusmevichientong
• Assortment Optimization with Mixtures of Logits Paat Rusmevichientong1
• Tractable Open Loop Policies for Joint Overbooking and Capacity Control over a Single Flight Leg with Multiple Fare Classes
• A Dynamic Programming Decomposition Method for Making Overbooking Decisions over an Airline Network
• A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
• A Parallelizable Dynamic Fleet Management Model with Random Travel Times
• Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
• A Stochastic Approximation Method for the Single-Leg Revenue Management Problem with Discrete
• Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
• Approximate Dynamic Programming Methods for an Inventory Allocation Problem under Uncertainty
• Computing Protection Level Policies for Dynamic Capacity Allocation Problems by Using Stochastic Approximation Methods
• A Tighter Variant of Jensen's Lower Bound for Stochastic Programs and Separable Approximations to Recourse Functions
• A Duality-Based Relaxation and Decomposition Approach for Inventory Distribution Systems
• Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm
• Sensitivity Analysis of a Dynamic Fleet Management Model Using Approximate Dynamic Programming
• Fleet Management Warren B. Powell and Huseyin Topaloglu
• Tuning Approximate Dynamic Programming Policies for Ambulance Redeployment via Direct Search
• Joint Stocking and Product Offer Decisions Under the Multinomial Logit Model
• Vol. 00, No. 0, Xxxxx 0000, pp. 000000 issn 0000-0000|eissn 0000-0000|00|0000|0001
• A Randomized Linear Programming Method for Network Revenue Management with Product-Specific No-Shows
• A Refined Deterministic Linear Program for the Network Revenue Management Problem with Customer Choice Behavior
• INFORMS--New Orleans 2005 c 2005 INFORMS | isbn 0000-0000 doi 10.1287/educ.1053.0000
• INFORMS--New Orleans 2005 c 2005 INFORMS | isbn 0000-0000 doi 10.1287/educ.1053.0000
• Computing Time-Dependent Bid Prices in Network Revenue Management Problems
• A Distributed Decision Making Structure for Dynamic Resource Allocation Using Nonlinear Functional
• Dynamic Programming Approximations for Stochastic, Time-Staged Integer Multicommodity Flow Problems
• Price Discounts in Exchange for Reduced Customer Demand Variability and Applications to Advance Demand Information Acquisition
• A Stochastic Approximation Algorithm to Compute Bid Prices for Joint Capacity Allocation and Overbooking over an Airline Network
• Approximate Dynamic Programming for Ambulance Redeployment Matthew S. Maxwell
• A Tractable Revenue Management Model for Capacity Allocation and Overbooking over an Airline Network
• Incorporating the Pricing Decisions into the Dynamic Fleet Management Problem
• On Approximate Linear Programming Approach for Network Revenue Management Problems
• A Duality Based Approach for Network Revenue Management in Airline Alliances