On a Class of Totally Unimodular Matrices
From MaRDI portal
Publication:3680604
DOI10.1287/moor.10.2.280zbMath0565.90042MaRDI QIDQ3680604
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.2.280
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
90C09: Boolean programming
Related Items
Unnamed Item, A structure theorem for graphs with no cycle with a unique chord and its consequences, Testing balancedness and perfection of linear matrices, A hierarchy of totally unimodular matrices, A decomposition of strongly unimodular matrices into incidence matrices of digraphs, Structural properties and decomposition of linear balanced matrices, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis, Balanced cycles and holes in bipartite graphs, Incidence and strong edge colorings of graphs, Decomposition of balanced matrices, Odd cycles and matrices with integrality properties, Decomposition of wheel-and-parachute-free balanced bipartite graphs, Balanced matrices, Odd cycles and \(\Theta\)-cycles in hypergraphs, Linear Balanceable and Subcubic Balanceable Graphs*, A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory, Structural properties and recognition of restricted and strongly unimodular matrices, Unnamed Item
Uses Software
