Integer version of the multipath flow network synthesis problem

DOI10.1016/j.dam.2008.01.015zbMath1155.90468OpenAlexW1973560665MaRDI QIDQ1003728

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

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.015

zbMATH Keywords

networkscombinatorial algorithmstrongly polynomial algorithmnetwork synthesismultipath flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (3)

Multi-terminal multipath flows: synthesis ⋮ Flows over edge-disjoint mixed multipaths and applications ⋮ An improved algorithm for decomposing arc flows into multipath flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multi-terminal multipath flows: synthesis
• The network synthesis problem in a cycle
• Flows over edge-disjoint mixed multipaths and applications
• An improved algorithm for decomposing arc flows into multipath flows
• On multiroute maximum flows in networks
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• An Application of Generalized Linear Programming to Network Flows
• Dynamic Routing in Fully Connected Networks
• 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: Integer version of the multipath flow network synthesis problem