An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network

MaRDI QIDQ2850152zbMATH OpenFDO

Authors O. O. Yemets', Ye. M. Yemets', Yu. F. Oleksijchuk

Publication date 26 September 2013

Published in Dopovidi Natsional'noï Akademiï Nauk Ukraïny. Matematyka, Pryrodoznavstvo, Tekhnichni Nauky (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4053314
• scientific article; zbMATH DE number 1062936
• Minimal blocking flow in networks
• scientific article; zbMATH DE number 988194
• scientific article; zbMATH DE number 4204092

Cited in

(2)

• scientific article; zbMATH DE number 4095217 (Why is no real title available?)
• scientific article; zbMATH DE number 871948 (Why is no real title available?)

This page was built for publication: An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network

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