Practical minimization of pairwise-covering test configurations using constraint programming.
Aymeric HervieuDusica MarijanArnaud GotliebBenoit BaudryPublished in: Inf. Softw. Technol. (2016)
Keyphrases
- constraint programming
- pairwise
- combinatorial problems
- constraint satisfaction problems
- constraint propagation
- constraint satisfaction
- integer programming
- global constraints
- search strategies
- np hard problems
- constraint logic programming
- column generation
- constraint optimization
- arc consistency
- constraint solving
- symmetry breaking
- itemset mining
- constraint solver
- search heuristics
- finite domain
- objective function
- markov random field
- hard and soft constraints
- constraint networks
- higher order
- data structure
- constraint problems
- dynamic programming
- backtrack search