On exact algorithms for the permutation CSP.
Eun Jung KimDaniel GonçalvesPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- exact algorithms
- constraint satisfaction problems
- combinatorial problems
- knapsack problem
- approximation algorithms
- constraint satisfaction
- constraint programming
- benchmark instances
- vehicle routing problem with time windows
- np hard
- exact solution
- benders decomposition
- decomposition methods
- computational problems
- constraint propagation
- heuristic methods
- combinatorial optimization
- arc consistency
- max sat
- combinatorial optimization problems
- constraint networks
- search space
- global constraints
- sat problem
- optimal solution
- nonlinear programming
- neural network
- np complete