Multiterminal xcut problems

DOI10.1007/BF02115756zbMath0741.90082OpenAlexW1975896992MaRDI QIDQ1179738

Refael Hassin

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

\(i-j\) xcut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

An algorithm for computing maximum solution bases ⋮ Flow trees for vertex-capacitated networks

Cites Work

• Multi-terminal maximum flows in node-capacitated networks
• Extracting maximal information about sets of minimum cuts
• An algorithm for computing maximum solution bases
• Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows

This page was built for publication: Multiterminal xcut problems