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

DOI10.1002/NAV.3800160407MaRDI QIDQ5592829zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• A suggested computation for maximal multi-commodity network flows

Cited in

(10)

• Study on the multicommodity reliability of a capacitated-flow network
• Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
• Multicommodity network flows—A survey
• System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
• An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts
• Performance evaluation for a transportation system in stochastic case
• scientific article; zbMATH DE number 4049354 (Why is no real title available?)
• A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity
• Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
• On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint

This page was built for publication: On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592829)