Minimum-Cost Multicommodity Network Flows

John A. Tomlin

Operations Research · 1966 · 178 citations · 5 references

Concepts

Abstract

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.

References

5