Network Flow in Graph Theory - The Producer’s Problem

DOI10.22147/JUSPS-A/291004MaRDI QIDQ4682670zbMATH OpenFDO

Authors George Mathew, Merlin Mary Abraham

Publication date 18 September 2018

Published in Journal of Ultra Scientist of Physical Sciences Section A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22147/JUSPS-A/291004

zbMATH Keywords

\(s\)-\(t\) cutaugmenting pathfeasible flowflowflow valueleewaymaximum flownetwork

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 3229051
• scientific article; zbMATH DE number 2084706
• scientific article; zbMATH DE number 3950393
• Network flow assignment as a fixed point problem
• scientific article; zbMATH DE number 33715
• scientific article; zbMATH DE number 42283
• Finding a feasible flow in a strongly connected network
• scientific article; zbMATH DE number 49483
• scientific article; zbMATH DE number 3174052
• The problem of maximum flow with minimum attainable cost in a network

Cited in

(1)

• On the history of the transportation and maximum flow problems

This page was built for publication: Network Flow in Graph Theory - The Producer’s Problem

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