Scholarlink

<p>Earlier versions of this work were presented at workshops in 2004–5 and the final version was published in the Constraints journal in 2006. In our paper we applied CP and SAT methods to the problem of finding covering arrays, which are combinatorial objects used to reduce the number of trials in testing applications. We were able to prove the optimality of some existing bounds and to find some improved solutions.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Comments on “Constraint models for the covering test problem”

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年7月11日

查看全文
  • Brahim Hnich,
  • Steven D. Prestwich,
  • Evgeny Selensky,
  • Barbara M. Smith

摘要

Earlier versions of this work were presented at workshops in 2004–5 and the final version was published in the Constraints journal in 2006. In our paper we applied CP and SAT methods to the problem of finding covering arrays, which are combinatorial objects used to reduce the number of trials in testing applications. We were able to prove the optimality of some existing bounds and to find some improved solutions.