An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network

Ernesto Q. V. Martins and Mario S. Rosa
Additional contact information
Ernesto Q. V. Martins: Universidade de Coimbra, Coimbra, Portugal
Mario S. Rosa: Universidade de Coimbra, Coimbra, Portugal

Operations Research, 1985, vol. 33, issue 3, 537-547

Abstract: We consider the maximal multicommodity funnel-node flow problem. That is, K commodities of flow must be simultaneously defined in an undirected network so that the flow of all the commodities passes through a specified node (the funnel-node) and is maximal. For this particular problem of multicommodity flows, we present a polynomially bounded algorithm.

Keywords: 487; maximal; funnel; flow (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.3.537 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:3:p:537-547

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().