Multi-commodity Flow
The multi-commodity flow problem is a generalization of the maximum flow problem, where we need to find a maximum (si,ti)- flow through the network for all commodities i=1,...,k. while keeping the sum of flow over all commodities on each arc below its capacity. The formulation for this problem is a linear program that can be solved in strongly polynomial time.
1444
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
