An approximate approach to the Unsplittable flow Edge-Load factor Balancing problem with the Lagrangian relaxation.
Daichi ShimizuNorihiko ShinomiyaPublished in: GCCE (2022)
Keyphrases
- lagrangian relaxation
- inference in graphical models
- integer programming
- column generation
- feasible solution
- lower bound
- min cost
- np hard
- dual decomposition
- linear programming
- branch and bound algorithm
- lower and upper bounds
- dynamic programming
- relaxation algorithm
- mixed integer programming
- capacity constraints
- lagrangian heuristic
- single machine scheduling problem
- mixed integer linear programs
- subgradient method
- graphical models
- network design problem
- linear program
- upper bound
- search space