A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory

DOI10.1080/02331938908843511zbMath0691.90064OpenAlexW2025548891MaRDI QIDQ3033566

No author found.

Publication date: 1989

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938908843511

zbMATH Keywords

cycleadjacency matrixmulticommodity flowtotal unimodularitybipartite oriented graphmulticommodity transportationcolumn valuation

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Total unimodularity and the transportation problem: a generalization
• On a Class of Totally Unimodular Matrices
• Unimodular matrices of flow problems with additional constraints

This page was built for publication: A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory