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

zbMATH Open1289.90044MaRDI QIDQ2850152FDOQ2850152

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)

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

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)