The Next Release Problem (NRP) aims to optimize customer profits and requirements
selection for the software releases. The research on the NRP is restricted by the growing …

The backbone of a satisfiable formula is the set of literals that are true in all its satisfying
assignments. Backbone computation can improve a wide range of SAT-based applications …

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to
combinatorial optimization problems. In this paper, we introduce an iterative search strategy …

In recent years, there has been much interest in phase transitions of combinatorial problems.
Phase transitions have been successfully used to analyze combinatorial optimization …

The localisation of faults in integrated circuits is a dominating factor in the overall verification
effort. The limited observability of internal signals of chips complicates the spatial and …

Boolean structural measures were introduced to explain the high performance of conflict-
driven clause-learning (CDCL) SAT solvers on industrial SAT instances. Those considered …

We study the backbone of the travelling salesperson optimization problem. We prove that it
is intractable to approximate the backbone with any performance guarantee, assuming that …

Software testing is important and time-consuming. A test suite, ie, a set of test cases, plays a
key role in validating the expected program behavior. In modern test-driven development, a …

Semi-supervised clustering under pairwise constraints (ie must-links and cannot-links) has
been a hot topic in the data mining community in recent years. Since pairwise constraints …

In propositional formulas, literals are assigned to True or False in each assignment.
Backbone literals are always assigned to True in every satisfiable assignment (model) of the …