| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6897905 | European Journal of Operational Research | 2013 | 11 Pages |
Abstract
⺠We address a problem of sequencing rows of a binary matrix. ⺠The objective is to minimise the total number of zeros in the gaps between blocks of consecutive 1s in the columns of the matrix. ⺠The problem is known to be NP-hard. ⺠We develop an exact solution algorithm, which is efficient for small matrices. ⺠Two constructive heuristics provide near optimal solutions for instances of any size.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Konstantin Chakhlevitch, Celia A. Glass, Natalia V. Shakhlevich,