scientific article; zbMATH DE number 4053314

MaRDI QIDQ3789304zbMATH OpenFDO

Authors S. L. Kuzmin

Publication date 1984

zbMATH Keywords

maximum flowminimum cutpolynomial algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 4204092
• scientific article; zbMATH DE number 1062936
• On the relation of max-flow to min-cut for generalized networks
• The maximum flow problem in a network with special conditions of flow distribution
• Algorithms for maximum network flow

Cited in

(11)

• Multi-terminal maximum flows in node-capacitated networks
• On the relation of max-flow to min-cut for generalized networks
• An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network
• Maximum flow in fiber-optic networks
• The maximum flow problem in a network with special conditions of flow distribution
• scientific article; zbMATH DE number 3870996 (Why is no real title available?)
• scientific article; zbMATH DE number 3970465 (Why is no real title available?)
• scientific article; zbMATH DE number 1062936 (Why is no real title available?)
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• scientific article; zbMATH DE number 961880 (Why is no real title available?)
• Minimum cost path problems with relays

This page was built for publication:

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