Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling.
Takuro FukunagaPublished in: APPROX/RANDOM (2022)
Keyphrases
- linear programming relaxation
- integrality gap
- linear programming
- knapsack problem
- lower bound
- column generation
- branch and bound
- feasible solution
- integer programming
- mixed integer programming
- scheduling problem
- integer program
- valid inequalities
- cutting plane
- production planning
- integer programming formulation
- linear program
- branch and bound algorithm
- np hard
- optimal solution
- optimization problems
- approximation algorithms
- objective function
- upper bound