Adaptive CP-Based Lagrangian Relaxation for TSP Solving.
Nicolas IsoartJean-Charles RéginPublished in: CPAIOR (2020)
Keyphrases
- lagrangian relaxation
- np hard
- mixed integer program
- integer programming
- subgradient method
- column generation
- lower bound
- feasible solution
- combinatorial optimization
- traveling salesman problem
- branch and bound algorithm
- constraint programming
- lower and upper bounds
- linear programming
- branch and bound search
- dual decomposition
- lagrangian dual
- relaxation algorithm
- capacity constraints
- optimal solution
- mixed integer programming
- dynamic programming
- optimization problems
- network design problem
- integer program
- linear programming problems
- branch and bound
- linear program
- ant colony optimization
- dual variables
- scheduling problem
- upper bound
- genetic algorithm
- mixed integer linear programs
- markov random field
- computational complexity
- constraint satisfaction problems