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
- constraint propagation
- combinatorial problems
- constraint satisfaction problems
- constraint satisfaction
- integer programming
- arc consistency
- constraint logic programming
- search strategies
- np hard problems
- constraint solver
- symmetry breaking
- search heuristics
- constraint problems
- constraint solving
- global constraints
- column generation
- constraint networks
- constraint optimization
- hard and soft constraints
- itemset mining
- propositional satisfiability
- finite domain
- backtrack search
- search algorithm
- constraint solvers