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
WBSNs (wireless body sensor network) like any other sensor networks suffers limited energy and are the highly distributed network… 
2012
2012
In this paper, we examine various branch and bound algorithms for a minimum congestion origin-destination integer multi-commodity… 
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… 
2005
2005
Title: ANALYSIS OF ROUTING STRATEGIES IN AIR TRANSPORTATION NETWORKS FOR EXPRESS PACKAGE DELIVERY SERVICES Subrat Mahapatra, M.S… 
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… 
2004
2004
We adapt a method proposed by Nesterov [19] to design an algorithm that computes optimal solutions to fractional packing problems… 
2002
2002
Limited capital investment for major transportation improvements and growth in metropolitan areas require the most efficient use…