Abstract We study a variant of the weighted consecutive ones property problem. Here, 0/1-matrix is given with cost associated to each its entries and one has find minimum set zero be turned in order make matrix have for rows. investigate polyhedral combinatorial properties problem we exploit them branch-and-cut algorithm. In particular, devise preprocessing rules variants “local cuts”. test res...