| Article ID: | iaor20041670 |
| Country: | United Kingdom |
| Volume: | 9 |
| Issue: | 6 |
| Start Page Number: | 775 |
| End Page Number: | 777 |
| Publication Date: | Nov 2002 |
| Journal: | International Transactions in Operational Research |
| Authors: | Haddadi Salim |
We show that consecutive block minimization problem is NP-hard even when restricted to binary matrices that have two ones per row.