A decomposition algorithm for multi-terminal network flows

DOI10.1016/0166-218X(86)90080-6zbMath0606.90046MaRDI QIDQ1085042

B. George

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

decomposition algorithmlarge networksmultiterminal maximum flowtri-connected components

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (1)

A decomposition algorithm for multi-terminal network flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple version of Karzanov's blocking flow algorithm
• A decomposition algorithm for multi-terminal network flows
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Multi-Terminal Network Flows
• Circular Cuts in a Network
• An Efficient Heuristic Procedure for Partitioning Graphs
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A decomposition algorithm for multi-terminal network flows