Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities.
Mikhail A. BraginPublished in: Ann. Oper. Res. (2024)
Keyphrases
- lagrangian relaxation
- feasible solution
- branch and bound algorithm
- integer programming
- mixed integer linear programming
- column generation
- linear program
- np hard
- linear programming
- lower bound
- dual decomposition
- dynamic programming
- lower and upper bounds
- relaxation algorithm
- capacity constraints
- lagrangian heuristic
- mixed integer program
- mixed integer programming
- mixed integer linear programs
- single machine scheduling problem
- network design problem
- neural network
- tabu search
- upper bound
- search space
- search algorithm
- genetic algorithm
- lagrangian dual