A novel dual-decomposition method based on p-Lagrangian relaxation.
Nikita BelyakFabricio OliveiraPublished in: CoRR (2023)
Keyphrases
- decomposition method
- lagrangian relaxation
- lagrangian dual
- dual variables
- integer programming
- lower bound
- feasible solution
- branch and bound algorithm
- column generation
- linear programming
- dynamic programming
- lower and upper bounds
- decomposition methods
- decomposition algorithm
- np hard
- capacity constraints
- shortest path
- tree decomposition
- subgradient method
- dual decomposition
- cutting plane algorithm
- relaxation algorithm
- mixed integer program
- branch and bound
- heuristic search
- optimal solution
- lagrangian heuristic
- set covering problem
- constraint programming
- linear program