A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Minimising the number of gap-zeros in binary matrices
2013
European Journal of Operational Research
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 refered to as the Consecutive One Augmentation Problem, and is known to be NP-hard. An analysis of the structure of an optimal solution allows us to focus on a restricted solution space, and to use an implicit representation for searching the space. We develop an exact solution algorithm, fixed-parameter tractable with
doi:10.1016/j.ejor.2013.01.028
fatcat:e73sregpsnd43gtwwvp3ttci4a