Decomposition of Balanced Matrices
Authors:
- Michele ConfortiMCMichele Conforti
- Gérard CornuéjolsGCGérard Cornuéjols
- M.R. RaoMRM.R. Rao
- 1 November 1999
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 77 (2) , 292-406
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Theorem of TruemperLecture Notes in Computer Science, 1998
- Perfect matchings in balanced hypergraphsCombinatorica, 1996
- Structural properties and decomposition of linear balanced matricesMathematical Programming, 1992
- Minimax relations for the partial q- colorings of a graphDiscrete Mathematics, 1989
- Structural properties and recognition of restricted and strongly unimodular matricesMathematical Programming, 1987
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Balanced matrices and property (G)1980
- A sufficient condition for a matrix to be totally unimodularNetworks, 1973
- Balanced matricesMathematical Programming, 1972
- Characterization of totally unimodular matricesProceedings of the American Mathematical Society, 1965