| Article ID: | iaor19942302 |
| Country: | Netherlands |
| Volume: | 61 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 18 |
| Publication Date: | Aug 1993 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Conforti Michele, Rao M.R. |
| Keywords: | matrices, programming: integer |
A (0,1) matrix is linear if it does not contain a 2×2 submatrix of all ones. In this paper the authors give polynomial algorithms to test whether a linear matrix is balanced or perfect. The algorithms are based on decomposition results previously obtained by the authors.