On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem

DOI10.1002/nav.3800160407zbMath0196.23404OpenAlexW1558299102MaRDI QIDQ5592829

John J. Jarvis

Publication date: 1969

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800160407

zbMATH Keywords

operations research

Related Items

Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes ⋮ A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity ⋮ System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight ⋮ On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint ⋮ An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts ⋮ Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths ⋮ Performance evaluation for a transportation system in stochastic case ⋮ Study on the multicommodity reliability of a capacitated-flow network ⋮ Multicommodity network flows—A survey ⋮ Unnamed Item

Cites Work

• A Suggested Computation for Maximal Multi-Commodity Network Flows
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems