The p-Lagrangian relaxation for separable nonconvex MIQCQP problems.
Tiago AndradeNikita BelyakAndrew C. EberhardSilvio HamacherFabricio OliveiraPublished in: J. Glob. Optim. (2022)
Keyphrases
- lagrangian relaxation
- subgradient method
- dual decomposition
- optimization problems
- feasible solution
- integer programming
- particle swarm optimization
- dynamic programming
- special case
- np complete
- neural network
- column generation
- lower and upper bounds
- np hard
- mixed integer programming
- network design problem
- mixed integer program
- evolutionary algorithm