The minimum-cost multicommodity network flow problem is formulated in both node-arc and arc-chain form, leading to very large linear programs. The special structure of these programs is utilized in algorithms for their solution.
No takes yet. Share an insight, caveat, or question.
John A. Tomlin (1966) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: