Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
Minimally nonideal matrices are a key to understanding when the set covering problem can be solved using linear programming. The complete classification of minimally nonideal matrices is an open problem. One of the most important results on these matrices comes from a theorem of Lehman, which gives a property of the core of a minimally nonideal matrix. Cornuejols and Novick gave a conjecture on the possible cores of minimally nonideal matrices. This paper disproves their conjecture by constructing a new infinite family of square minimally nonideal matrices. In particular, we show that there exists a minimally nonideal matrix with r ones in each row and column for any r=3.