Revenue management practices often include overbooking capacity to account for customers who make reservations but do not show up. In this paper, we consider the network revenue management problem with no-shows and overbooking, where the show-up probabilities are specific to each product....

The network choice revenue management problem models customers as choosing from an offerset, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear...

The network revenue management (RM) problem arises in airline, hotel, media, and other industries where the sale products use multiple resources. It can be formulated as a stochastic dynamic program but the dynamic program is computationally intractable because of an exponentially large state...

A fundamental decision every merchant has to make is on is how large his stores should be. This is particularly true in light of the drastic changes retail concepts have seen in the last decade. There has been a noticeable tendency, particularly for food and convenience retailers, to open more...

Many dynamic revenue management models divide the sale period into a finite number of periods T and assume, invoking a fine-enough grid of time, that each period sees at most one booking request. These Poisson-type assumptions restrict the variability of the demand in the model, but researchers...

Network Revenue Management can be formulated as a stochastic dynamic programming problem ("optimal" solution) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear...