# A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management

@article{Bumpensanti2020ARH, title={A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management}, author={Pornpawee Bumpensanti and He Wang}, journal={Manag. Sci.}, year={2020}, volume={66}, pages={2993-3009} }

We consider the canonical (quantity-based) network revenue management problem, where a firm accepts or rejects incoming customer requests irrevocably in order to maximize expected revenue given limited resources. Due to the curse of dimensionality, the exact solution to this problem by dynamic programming is intractable when the number of resources is large. We study a family of re-solving heuristics that periodically re-optimize an approximation to the original problem known as the… CONTINUE READING

9 Citations

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

- Computer Science, Mathematics
- 2019

4

The Bayesian Prophet: A Low-Regret Framework for Online Decision Making

- Mathematics, Computer Science
- 2019

8

Simple and Fast Algorithm for Binary Integer and Online Linear Programming

- Mathematics, Computer Science
- 2020

1

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 25 REFERENCES

A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice

- Mathematics, Computer Science
- 2012

85

An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem

- Mathematics, Computer Science
- 2008

57

An Analysis of the Control-Algorithm Re-solving Issue in Inventory and Revenue Management

- Computer Science
- 2008

46

Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management

- Mathematics, Computer Science
- 2013

29

On the Choice-Based Linear Programming Model for Network Revenue Management

- Economics, Computer Science
- 2008

279