An algorithm for computing maximum solution bases

DOI10.1016/0167-6377(90)90025-ZzbMath0721.90061OpenAlexW2001558518MaRDI QIDQ2641220

Refael Hassin

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90025-z

zbMATH Keywords

maximum solution basismultiterminal cut problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (2)

Flow trees for vertex-capacitated networks ⋮ Multiterminal xcut problems

Cites Work

• Unnamed Item
• Multi-terminal maximum flows in node-capacitated networks
• Ancestor tree for arbitrary multi-terminal cut functions
• Multiterminal xcut problems
• Maximum concurrent flows and minimum cuts
• Very Simple Methods for All Pairs Network Flow Analysis
• Solution Bases of Multiterminal Cut Problems
• A Theory on Extending Algorithms for Parametric Problems
• Multi-Terminal Network Flows

This page was built for publication: An algorithm for computing maximum solution bases