Solution Bases of Multiterminal Cut Problems

DOI10.1287/MOOR.13.4.535MaRDI QIDQ3820346zbMATH OpenOpenAlexFDO

Authors Refael Hassin

Publication date 1988

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.13.4.535

zbMATH Keywords

2-commodity maxflow problemscutsedge capacitiesmultiterminal problemundirected network

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 176254
• Compact representations of cuts
• Crossing properties of multiterminal cuts
• scientific article; zbMATH DE number 3947967
• An algorithm for computing maximum solution bases

Cited in

(13)

• The planar multiterminal cut problem
• Ancestor tree for arbitrary multi-terminal cut functions
• Multiterminal xcut problems
• Maximum concurrent flows and minimum cuts
• Extracting maximal information about sets of minimum cuts
• Dynamic programming and graph optimization problems
• Generalizing the all-pairs min cut problem
• Multiterminal flows and cuts
• Multiroute flows: cut-trees and realizability
• An algorithm for computing maximum solution bases
• Crossing properties of multiterminal cuts
• Basis characterisation for linear multicommodity network programs
• Flow trees for vertex-capacitated networks

This page was built for publication: Solution Bases of Multiterminal Cut Problems

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