Minimising the number of gap-zeros in binary matrices

详细信息    查看全文

• 作者：Konstantin Chakhlevitch^a ; Celia A. Glass^a ; ^{C.A.Glass@city.ac.uk} ; Natalia V. Shakhlevich^b
• 关键词：Combinatorial optimisation ; Binary matrices ; Consecutive ones property ; Scheduling ; Heuristics
• 刊名：European Journal of Operational Research
• 出版年：2013
• 出版时间：16 August, 2013
• 年：2013
• 卷：229
• 期：1
• 页码：48-58
• 全文大小：815 K

文摘

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 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, which is linear-time in the number of rows if the number of columns is constant, and two constructive heuristics to tackle instances with an arbitrary number of columns. The heuristics use a novel solution representation based upon row sequencing. In our computational study, all heuristic solutions are either optimal or close to an optimum. One of the heuristics is particularly effective, especially for problems with a large number of rows.