On duality and fractionality of multicommodity flows in directed networks

In this paper we address a topological approach to multiflow (multicommodity flow) problems in directed networks. Given a terminal weight μ , we define a metrized polyhedral complex, called the directed tight span T μ , and prove that the dual of the μ -weighted maximum multiflow problem reduces to...

Full description

Saved in:
Bibliographic Details
Published in:Discrete optimization 2011-08, Vol.8 (3), p.428-445
Main Authors: Hirai, Hiroshi, Koichi, Shungo
Format: Article
Language:English
Subjects:
Facility locations
Metrics
Min–max theorems
Multicommodity flows
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we address a topological approach to multiflow (multicommodity flow) problems in directed networks. Given a terminal weight μ , we define a metrized polyhedral complex, called the directed tight span T μ , and prove that the dual of the μ -weighted maximum multiflow problem reduces to a facility location problem on T μ . Also, in case where the network is Eulerian, it further reduces to a facility location problem on the tropical polytope spanned by μ . By utilizing this duality, we establish the classifications of terminal weights admitting a combinatorial min–max relation (i) for every network and (ii) for every Eulerian network. Our result includes the Lomonosov–Frank theorem for directed free multiflows and Ibaraki–Karzanov–Nagamochi’s directed multiflow locking theorem as special cases.
ISSN:1572-5286
1873-636X
DOI:10.1016/j.disopt.2011.03.001