Learn More
The Multicommodity Flow Problem (MCFP) considers the efficient routing of commodities from their origins to their destinations, subject to capacity restrictions and edge costs. This paper studies the NP-hard Minimum Cost Multicommodity k-splittable Flow Problem in which each commodity may use at most k paths between its origin and its destination. The(More)
  • 1