A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms.
Dmitry I. BelovRonald D. ArmstrongPublished in: Comput. Optim. Appl. (2006)
Keyphrases
- constraint programming
- maximum number
- combinatorial problems
- constraint satisfaction problems
- constraint propagation
- integer programming
- search strategies
- constraint satisfaction
- global constraints
- constraint optimization
- hard and soft constraints
- search heuristics
- symmetry breaking
- np hard problems
- backtrack search
- constraint logic programming
- constraint solver
- column generation
- arc consistency
- finite domain
- constraint networks
- dynamic programming
- simulated annealing