Decomposition algorithms for locating minimal cuts in a network

DOI10.1007/BF01581046MaRDI QIDQ3931039zbMATH OpenOpenAlexFDO

Authors John J. Jarvis, Suleyman Tufekci

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01581046

zbMATH Keywords

decomposition algorithmslarge directed networklocating minimal cutslower boundsworst case analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• A decomposition algorithm for optimality problems in tree-structured networks
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Flow Switching Approach to the Maximum Flow Problem: I
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Minimal disconnecting sets in directed multi‐commodity networks
• More pathological examples for network flow problems
• Multi-Terminal Network Flows
• Optimum Network Partitioning
• Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Decomposition algorithms for locating minimal cuts in a network

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