A strong Lagrangian relaxation for general discrete-choice network revenue management.

Sumit Kunnumkal Kalyan T. Talluri

Published in: Comput. Optim. Appl. (2019)

Keyphrases

lagrangian relaxation
network revenue management
lower bound
integer programming
special case
np hard
branch and bound algorithm
feasible solution
lower and upper bounds
dynamic programming
constraint satisfaction
dual decomposition