Skip to search formSkip to main contentSkip to account menu

Multi-commodity flow problem

Known as: Concurrent flow, Multi-commodity flow, Multi commodity flow 
The multi-commodity flow problem is a network flow problem with multiple commodities (flow demands) between different source and sink nodes.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
This paper researches combinatorial algorithms for the multi-commodity flow problem. We relax the capacity constraints and… 
2019
2019
In this article an improved multi-commodity network flow (MCNF) model is introduced to holistically assess a multi modal… 
2009
2009
The Convex Multi-Commodity Flow Problem is a central routing problem in road and telecom traffic. We show that the traditional… 
2005
2005
Based on a three-level competitive supply chain network with multi-commodity flow, we analyze the independent decisions of the… 
2004
2004
  • S. Krile
  • 2004
  • Corpus ID: 1968499
In This work the efficient algorithm for optimal cargo transport of N types of containers with limited ship capacity, minimizing… 
2002
2002
Limited capital investment for major transportation improvements and growth in metropolitan areas require the most efficient use… 
1995
1995
["A numerical model is developed to examine steady laminar flame spread and extinction over a thin solid in concurrent flows with… 
1995
1995
In this paper, we present a new interior-point based polynomial algorithm for the multicommodity flow problem and its variants… 
1985
1985
A combined experimental and numerical study of two-phase steam/water flow in porous media was carried out. An experiment…