Analytic proofs of a network feasibility theorem and a theorem of Fulkerson

DOI10.1016/0024-3795(79)90155-1zbMath0402.15008OpenAlexW1990054259MaRDI QIDQ1255545

David J. jun. Houck, Arthur O. Pittenger

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0024-3795(79)90155-1

zbMATH Keywords

Analytic ProofsNetwork Feasibility TheoremTheorem of Fulkerson

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Stochastic matrices (15B51)

Cites Work

• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Correction to 'A constructive decomposition and Fulkerson's characterization of permutation matrices'
• A proof of Fulkerson's characterization of permutation matrices
• A constructive decomposition and Fulkerson's characterization of permutation matrices

This page was built for publication: Analytic proofs of a network feasibility theorem and a theorem of Fulkerson