Characterization of Totally Unimodular Matrices

DOI10.2307/2035618zbMATH Open0134.25201OpenAlexW4241564263MaRDI QIDQ5345002FDOQ5345002

Authors: Paul Camion 

Publication date: 1965

Full work available at URL: https://doi.org/10.2307/2035618

zbMATH Keywords

linear algebra, polynomials, forms

Cites Work

• Matroids and Graphs
• Title not available (Why is that?)
• On linear systems with integral valued solutions
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (38)

• On Padberg's conjecture about almost totally unimodular matrices
• On linear programming duality and Landau's characterization of tournament
• \(k\)-integrality, an extension of total unimodularity
• On pseudounimodular matrices
• A hierarchy of totally unimodular matrices
• Rational and integral \(k\)-regular matrices.
• On the budget-restricted max flow problem
• On unimodular graphs with a unique perfect matching
• A decomposition theory for matroids. VII: Analysis of minimal violation matrices
• A note on the total unimodularity of matrices
• Local unimodularity of matrix-vector pairs
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• On unimodular graphs
• Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra
• Totally unimodular Leontief directed hypergraphs
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The use of jacobi's lemma in unimodularity theory
• On box-perfect graphs
• Discrete extremal problems
• Box-total dual integrality, box-integrality, and equimodular matrices
• Recognizing balanceable matrices
• Balanced matrices
• Two simple applications of the unmodularity property
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
• Optimal loop storage allocation for argument-fetching dataflow machines
• Oriented hypergraphs: balanceability
• Tool switching problems with tool order constraints
• Unimodularity and circle graphs
• Structural properties and recognition of restricted and strongly unimodular matrices
• Decomposition of balanced matrices
• Binary signed-graphic matroids: representations and recognition algorithms
• Complement total unimodularity
• Sufficient enlargements of minimal volume for finite-dimensional normed linear spaces
• Non total-unimodularity neutralized simplicial complexes
• Total unimodularity and the Euler-subgraph problem
• Balanced \(0,\pm 1\) matrices. I: Decomposition
• A decomposition theory for matroids. II. Minimal violation matroids

This page was built for publication: Characterization of Totally Unimodular Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5345002)