A Heuristic Approach to the Consecutive Ones Submatrix Problem
Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the C...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Science for Women, University of Baghdad
2023-02-01
|
| Series: | Baghdad Science Journal |
| Subjects: | |
| Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/6373 |
| Summary: | Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.
|
|---|---|
| ISSN: | 2078-8665 2411-7986 |