Total unimodularity and the transportation problem: a generalization

DOI10.1016/0024-3795(74)90003-2MaRDI QIDQ1210968zbMATH OpenOpenAlexFDO

Authors Kenneth R. Rebman

Publication date 1974

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(74)90003-2

Mathematics Subject Classification ID

Linear programming (90C05) Conditioning of matrices (15A12)

Cited in

(7)

• A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory
• Subspaces with well-scaled frames
• Further results on the spectral decomposition of an incidence matrix
• Graphic matroids and the multicommodity transportation problem
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
• Unimodular matrices of flow problems with additional constraints
• Algebraic characterizations of the singular value decompositions in the transportation problem

This page was built for publication: Total unimodularity and the transportation problem: a generalization

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