Equivalence of two linear programming relaxations for broadcast scheduling.
Samir KhullerYoo Ah KimPublished in: Oper. Res. Lett. (2004)
Keyphrases
- broadcast scheduling
- linear programming relaxation
- linear programming
- knapsack problem
- lower bound
- column generation
- integer programming
- feasible solution
- mixed integer programming
- branch and bound
- cutting plane
- valid inequalities
- upper bounding
- lagrangian relaxation
- mixed integer
- integer program
- optimal solution
- objective function
- linear program