Skip to Main Content
In this paper, we define a new subclass of integer linear programming problems called the composition problem. We shall propose efficient algorithms for solving this problem and its variants. Moreover, as an application of the composition problem, those algorithms are applied to solve the P-constrained secure set problem, which is a variation of the secure set problem introduced in , on trees. A P-constrained secure set problem is to find a minimum secure set containing a set of |P| predetermined vertices.