The segment minimization problem consists of finding a smallest set of binary matrices (segments), where non-zero values in each row of each matrix are consecutive, each matrix is assigned a positive… (More)

We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek a decomposition of I as a weighted sum of binary matrices… (More)

In this paper we consider the problem of finding a vector that can be written as a nonnegative, integer and linear combination of given 0-1 vectors, the generators, such that the l1-distance between… (More)

In this article, we investigate the Minimum Cardinality Segmentation Problem (MCSP), an NP-hard combinatorial optimization problem arising in intensity-modulated radiation therapy. The problem… (More)

In the present paper we consider a particular case of the segmentation problem arising in the elaboration of radiation therapy plans. This problem consists in decomposing an integer matrix A into a… (More)

In this paper we consider the problem of finding a vector that can be written as a nonnegative, integer and linear combination of given 0-1 vectors, the generators, such that the l1-distance between… (More)