Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP.
Raphaël BoudreaultClaude-Guy QuimperPublished in: IJCAI (2021)
Keyphrases
- lagrangian relaxation
- np hard
- integer programming
- lower bound
- column generation
- branch and bound algorithm
- constraint programming
- dynamic programming
- linear programming
- feasible solution
- lagrangian heuristic
- lower and upper bounds
- dual decomposition
- optimal solution
- mixed integer programming
- capacity constraints
- traveling salesman problem
- shortest path
- optimization problems
- relaxation algorithm
- neural network
- combinatorial optimization
- upper bound
- evolutionary algorithm
- single machine scheduling problem
- subgradient method
- approximation algorithms
- scheduling problem
- mixed integer program
- search space
- objective function
- mixed integer linear programs
- learning algorithm