Chakhlevitch, Konstantin; Glass, Celia A.; Shakhlevich, … - In: European Journal of Operational Research 229 (2013) 1, pp. 48-58
We study a problem of minimising the total number of zeros in the gaps between blocks of consecutive ones in the columns of a binary matrix by permuting its rows. The problem is referred to as the Consecutive Ones Matrix Augmentation Problem, and is known to be NP-hard. An analysis of the...