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)

Related topics

Related topics

8 relations
Approximate max-flow min-cut theoremCirculation problemFlow networkGraver basis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Dynamic Combined Flow Algorithm for the Two-Commodity Max-Flow Problem Over Delay-Tolerant Networks
The multi-commodity flow problem plays an important role in network optimization, routing, and service scheduling. With the… 
2016
2016
New multi-commodity flow formulations for the pooling problem
The pooling problem is a nonconvex nonlinear programming problem with numerous applications. The nonlinearities of the problem… 
2016
2016
Finding feasible solutions for multi-commodity flow problems
Many transportation, communications, and logistics problems can be formulated as large multi-commodity flow problems, which are… 
Highly Cited
2013
Highly Cited
2013
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply… 
Highly Cited
2007
Highly Cited
2007
An optimization model for the container pre-marshalling problem
Highly Cited
2003
Highly Cited
2003
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem
This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem of… 
Highly Cited
2003
Highly Cited
2003
A multi-commodity flow based approach to virtual network resource allocation
The virtual network (VN) concept has been studied as a useful mean in supporting rapid service creation and deployment. This… 
Highly Cited
1994
Highly Cited
1994
A column generation and partitioning approach for multi-commodity flow problems
Multi-commodity network flow problems, prevalent in transportation, production and communication systems, can be characterized by… 
Highly Cited
1991
Highly Cited
1991
Fast approximation algorithms for multicommodity flow problems
All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The… 
1971
1971
An algorithm for certain multi-commodity flow problems
In this paper an algorithm is presented for solving a certain class of multi-commodity flow problems. The class of problems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)