Combining VNS with constraint programming for solving anytime optimization problems.
Samir LoudniPatrice BoizumaultPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- constraint programming
- optimization problems
- metaheuristic
- combinatorial problems
- search heuristics
- limited discrepancy search
- finite domain
- constraint propagation
- combinatorial optimization
- constraint problems
- constraint optimization
- variable neighborhood search
- constraint satisfaction problems
- evolutionary algorithm
- constraint satisfaction
- constraint solvers
- integer programming
- global constraints
- tabu search
- graph coloring
- traveling salesman problem
- search strategies
- constraint logic programming
- symmetry breaking
- np hard problems
- constraint solving
- knapsack problem
- combinatorial search
- arc consistency
- column generation
- machine learning or data mining
- objective function
- cost function
- constraint networks
- solution quality
- branch and bound algorithm
- branch and bound
- systematic search
- hard and soft constraints
- hybrid method
- constraint solver
- propositional satisfiability
- machine learning and data mining
- search space
- search algorithm