Multiroute flows: cut-trees and realizability

DOI10.1016/j.disopt.2005.03.005zbMath1131.90066OpenAlexW1981813514MaRDI QIDQ2581318

R. Chandrasekaran, K. P. K. Nair, Santosh N. Kabadi

Publication date: 9 January 2006

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.03.005

zbMATH Keywords

multiroute flowcut-treenetwork realizability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

Related Items (1)

Impact of a varying capacity on the all pairs 2-route network flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multi-terminal multipath flows: synthesis
• Generalizing the all-pairs min cut problem
• Multiterminal flows and cuts
• On multiroute maximum flows in networks
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows
• Integer Solution to Synthesis of Communication Networks
• Simple Constructions for Multiterminal Network Flow Synthesis
• Network synthesis with few edges

This page was built for publication: Multiroute flows: cut-trees and realizability