A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays.
Jose Torres-JimenezIdelfonso Izquierdo-MarquezAldo Gonzalez-GomezHimer Avila-GeorgePublished in: MICAI (1) (2015)
Keyphrases
- branch bound
- objective function
- covering arrays
- computational complexity
- np hard
- lower and upper bounds
- matching algorithm
- expectation maximization
- optimal solution
- dynamic programming
- search space
- particle swarm optimization
- linear programming
- optimization algorithm
- pattern matching
- ant colony optimization
- upper bound
- convergence rate
- lower bound