On some characterisations of totally unimodular matrices
From MaRDI portal
Cites work
- A note on the total unimodularity of matrices
- Balanced matrices
- scientific article; zbMATH DE number 3427408 (Why is no real title available?)
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3495859 (Why is no real title available?)
- scientific article; zbMATH DE number 3628712 (Why is no real title available?)
- scientific article; zbMATH DE number 3378938 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- Integer Rounding for Polymatroid and Branching Optimization Problems
- On totally unimodular matrices
- The edge-coloring of complete hypergraphs. I
Cited in
(9)- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- Graph theoretic relaxations of set covering and set partitioning problems
- Balanced matrices
- Good and nice colorings of balanced hypergraphs
- Colorings of k-balanced matrices and integer decomposition property of related polyhedra
- A decomposition property of polyhedra
- Integral decomposition in polyhedra
- On unimodular graphs with a unique perfect matching
- Towards a structural characterization of unimodular graphs with a unique perfect matching
This page was built for publication: On some characterisations of totally unimodular matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895600)