A New Dynamic Programming Decomposition Method for the Network Revenue Management Problem with Customer Choice Behavior

@inproceedings{Kunnumkal2010AND,
  title={A New Dynamic Programming Decomposition Method for the Network Revenue Management Problem with Customer Choice Behavior},
  author={Sumit Kunnumkal and Huseyin Topaloglu},
  year={2010}
}
In this paper, we propose a new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. The fundamental idea behind our dynamic programming decomposition method is to allocate the revenue associated with an itinerary among the different flight legs and to solve a single-leg revenue management problem for each flight leg in the airline network. The novel aspect of our approach is that it chooses the revenue allocations by solving an… CONTINUE READING
BETA

Figures and Tables from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 49 CITATIONS

On a Piecewise-Linear Approximation for Network Revenue Management

  • Math. Oper. Res.
  • 2016
VIEW 13 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Computing Time-Dependent Bid Prices in Network Revenue Management Problems

  • Transportation Science
  • 2010
VIEW 7 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Randomization Approaches for Network Revenue Management with Customer Choice Behavior

VIEW 8 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Similar Papers