Boosting local search with Lagrangian relaxation.
Zhilei RenHe JiangShuwei ZhangJingxuan ZhangZhongxuan LuoPublished in: J. Heuristics (2014)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- branch and bound algorithm
- tabu search
- np hard
- column generation
- lower bound
- dynamic programming
- linear programming
- optimal solution
- lower and upper bounds
- search algorithm
- combinatorial optimization
- lagrangian heuristic
- capacity constraints
- relaxation algorithm
- dual decomposition
- search space
- learning algorithm
- memetic algorithm
- genetic algorithm
- branch and bound
- simulated annealing
- mixed integer program
- neural network
- shortest path
- valid inequalities
- mathematical model
- knapsack problem
- upper bound
- feature selection