Login / Signup

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.

Carlos AnsóteguiIdelfonso IzquierdoFelip ManyàJosé Torres-Jiménez
Published in: CCIA (2013)
Keyphrases
  • max sat
  • covering arrays
  • lower bound
  • tabu search
  • weighted max sat
  • optimal solution
  • satisfiability problem
  • dynamic programming
  • search algorithm
  • branch and bound
  • constraint satisfaction
  • branch and bound algorithm