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

DOI10.1016/0024-3795(79)90155-1MaRDI QIDQ1255545zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A constructive decomposition and Fulkerson's characterization of permutation matrices
• A proof of Fulkerson's characterization of permutation matrices
• A theorem on flows in networks
• Correction to 'A constructive decomposition and Fulkerson's characterization of permutation matrices'
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)

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

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