On Linear Programming Relaxations for Unsplittable Flow in Trees.
Zachary FriggstadZhihan GaoPublished in: APPROX-RANDOM (2015)
Keyphrases
- linear programming relaxation
- steiner tree
- lower bound
- linear programming
- knapsack problem
- decision trees
- column generation
- branch and bound
- cutting plane
- integer programming
- integer program
- feasible solution
- mixed integer programming
- optimization problems
- linear program
- optimal solution
- upper bound
- state space
- multi objective
- valid inequalities
- reinforcement learning