Structural properties and decomposition of linear balanced matrices

DOI10.1007/BF01581196zbMath0767.90068OpenAlexW2020585303MaRDI QIDQ1196165

S. Singh

Publication date: 17 December 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581196

zbMATH Keywords

decompositionblock-diagonal structurepolyhedral combinatoricstotally unimodular matricesintegrality of polytopeslinear balanced matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items

Decomposition of wheel-and-parachute-free balanced bipartite graphs, Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths, Balanced matrices, Square-free perfect graphs., Unnamed Item, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Testing balancedness and perfection of linear matrices, A faster algorithm for finding minimum Tucker submatrices, The strong perfect graph conjecture holds for diamonded odd cycle-free graphs, Odd cycles and matrices with integrality properties, Decomposition of balanced matrices, A polynomial recognition algorithm for balanced matrices, Linear Balanceable and Subcubic Balanceable Graphs*

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing balancedness and perfection of linear matrices
• Decomposition of regular matroids
• Characterizations of totally balanced matrices
• On a Class of Totally Unimodular Matrices
• Totally-Balanced and Greedy Matrices
• Structural properties and recognition of restricted and strongly unimodular matrices
• Balanced matrices and property (G)
• Balanced matrices