On some characterisations of totally unimodular matrices

DOI10.1007/BF01589329zbMath0449.15013OpenAlexW2062220035MaRDI QIDQ3895600

Dominique de Werra

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

totally unimodular matricesperfect matricesbalanced matrices

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39)

Related Items (8)

A decomposition property of polyhedra ⋮ Graph theoretic relaxations of set covering and set partitioning problems ⋮ On unimodular graphs with a unique perfect matching ⋮ Balanced matrices ⋮ Good and nice colorings of balanced hypergraphs ⋮ Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra ⋮ A decomposition theory for matroids. VII: Analysis of minimal violation matrices ⋮ Integral decomposition in polyhedra

Cites Work

• A note on the total unimodularity of matrices
• The edge-coloring of complete hypergraphs. I
• Integer Rounding for Polymatroid and Branching Optimization Problems
• On totally unimodular matrices
• Balanced matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some characterisations of totally unimodular matrices