TESTING BALANCEDNESS AND PERFECTION OF LINEAR MATRICES

Authors
CONFORTI M RAO MR
Citation
M. Conforti et Mr. Rao, TESTING BALANCEDNESS AND PERFECTION OF LINEAR MATRICES, Mathematical programming, 61(1), 1993, pp. 1-18
Citations number
18
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Applications & Cybernetics
Journal title
Mathematical programming → ACNP
ISSN journal
00255610
Volume
61
Issue
1
Year of publication
1993
Pages
1 - 18
Database
ISI
SICI code
0025-5610(1993)61:1<1:TBAPOL>2.0.ZU;2-J
Abstract
A (0, 1) matrix is linear if it does not contain a 2 x 2 submatrix of all ones. In this paper we give polynomial algorithms to test whether a linear matrix is balanced or perfect. The algorithms are based on de composition results previously obtained by the authors.