A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs.
Wei-An ChenZhen ZhuNan KongPublished in: Optim. Lett. (2018)
Keyphrases
- feasible solution
- lagrangian relaxation
- objective function
- optimal solution
- linear programming
- tabu search
- solution quality
- mathematical model
- solution space
- mixed integer
- linear programming relaxation
- facility location
- mixed integer programming
- computational complexity
- mixed integer program
- extreme points
- genetic algorithm
- linear program
- dynamic programming
- multi objective
- integer programming
- knapsack problem
- valid inequalities
- lower bound