Solution Bases of Multiterminal Cut Problems
From MaRDI portal
Publication:3820346
DOI10.1287/moor.13.4.535zbMath0667.90034OpenAlexW2127631842MaRDI QIDQ3820346
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (11)
Dynamic programming and graph optimization problems ⋮ An algorithm for computing maximum solution bases ⋮ Generalizing the all-pairs min cut problem ⋮ Flow trees for vertex-capacitated networks ⋮ Multiterminal flows and cuts ⋮ 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 ⋮ Multiroute flows: cut-trees and realizability
This page was built for publication: Solution Bases of Multiterminal Cut Problems
