An Improved Dynamic Programming Decomposition Approach for Network Revenue Management

2011 ◽  
Vol 13 (1) ◽  
pp. 35-52 ◽  
Author(s):  
Dan Zhang
Keyword(s):  
Dynamic Programming ◽  
Revenue Management ◽  
Decomposition Approach ◽  
Network Revenue Management ◽  
Improved Dynamic Programming ◽  
Dynamic Programming Decomposition ◽  
Network Revenue

An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals

2020 ◽  
Vol 68 (3) ◽  
pp. 834-855 ◽  
Author(s):  
Yuhang Ma ◽  
Paat Rusmevichientong ◽  
Mika Sumida ◽  
Huseyin Topaloglu
Keyword(s):  
Approximation Algorithm ◽  
Revenue Management ◽  
Capacity Control ◽  
Network Revenue Management ◽  
Pricing Decisions ◽  
Multiple Products ◽  
Performance Guarantees ◽  
Optimal Capacity ◽  
Airline Tickets ◽  
Network Revenue

Many revenue management problems require making capacity control and pricing decisions for multiple products. The decisions for the different products interact because either the products use a common pool of resources or the customers choose and substitute among the products. When pricing airline tickets, for example, different itinerary products use the capacities on common flight legs and the customers choose and substitute among different itinerary products that serve the same origin-destination pair. Finding the optimal capacity control and pricing decisions in such problems can be challenging because one needs to simultaneously consider the capacities available to serve a large pool of products. In “An Approximation Algorithm for Network Revenue Management under Nonstationary Arrivals,” Ma, Rusmevichientong, Sumida, and Topaloglu develop efficient methods to make decisions with performance guarantees in high-dimensional capacity control and pricing problems.

Sign in / Sign up

Export Citation Format

Share Document