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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Many transportation, communications, and logistics problems can be formulated as large multi-commodity flow problems, which are… (More)
  • figure 1.1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2008
2008
Utilizing smart antennas in multi-hop wireless networks can boost their performance. However, most of the work done in the… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?
2007
2007
The multi-commodity flow problem is a classical combinatorial optimization problem that addresses a number of practically… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The Virtual Network (VN) concept has been studied as a useful mean in supporting rapid service creation and deployment. In this… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Improved Approximation Algorithms the Multi-Commodity Flow Problem and Competitive Routing in Dynamic Networks 
Is this relevant?
1994
1994
The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally… (More)
  • figure 1
  • figure 3
Is this relevant?
1993
1993
The traditional muIti-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive… (More)
  • table I
  • table II
Is this relevant?
Highly Cited
1975
Highly Cited
1975
A very primitive version of Gotlieb's timetable problem is shown to be NP-complete, and therefore all the common timetable… (More)
  • figure 2
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?