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
In this article an improved multi-commodity network flow (MCNF) model is introduced to holistically assess a multi modal… 
2015
2015
Structured foam packing has been proven to enhance mass and heat transfer and decrease pressure drop due to the intrinsic open… 
2012
2012
Duration & Cost Optimization for Transportation Problem (DCOTP) is to simultaneously optimize the duration and cost of… 
2012
2012
In classical linear network flow (LNF) problems, a network consists of multiple source and sink nodes, where each node is a sink… 
2010
2010
An airline crew rostering problem is a large-scaled and complex optimization problem that assigns crew members to the flight… 
2009
2009
As wireless communication moves to all IP and packet based processing, the virtualization techniques will need to be introduced… 
2009
2009
The Convex Multi-Commodity Flow Problem is a central routing problem in road and telecom traffic. We show that the traditional… 
2006
2006
Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc… 
1998
1998
This paper describes a cone calorimeter fire test program and the application of a vertical flame spread model developed for… 
1985
1985
A combined experimental and numerical study of two-phase steam/water flow in porous media was carried out. An experiment…