On the relation of max-flow to min-cut for generalized networks

DOI10.1016/0377-2217(89)90357-3zbMATH Open0675.90030OpenAlexW2113683184MaRDI QIDQ1122471FDOQ1122471

Authors: P. Simin Pulat 

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90357-3

Recommendations

• Maximum outflow in generalized flow networks
• scientific article; zbMATH DE number 4053314
• Faster algorithms for the generalized network flow problem
• New algorithms for generalized network flows
• A decomposition algorithm to determine the maximum flow in a generalized network

zbMATH Keywords

max-flow min-cut theoremmaximum flow algorithmsgeneralized networkarc multipliers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• Calculating Maximal Flows in a Network with Positive Gains
• Maximum outflow in generalized flow networks

Cited In (10)

• The max-flow min-cut property and \(\pm 1\)-resistant sets
• Title not available (Why is that?)
• Recognizing max-flow min-cut path matrices
• Maximum outflow in generalized flow networks
• A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
• A decomposition algorithm to determine the maximum flow in a generalized network
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum flow in fiber-optic networks
• Modified Pulat's algorithm for the maximum outflow problem in undirected generalized networks

This page was built for publication: On the relation of max-flow to min-cut for generalized networks

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