Multicommodity Demand Flow in a Tree

Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd

Abstract: We consider requests for capacity in a given tree network T = (V,E) where each edge of the tree has some integer capacity u e. Each request consists of an integer demand d f and a profit w f which is obtained if the request is satisfied. The objective is to find a set of demands that can be feasibly routed in the tree and which provide a maximum profit. This generalizes well-known problems including the knapsack and b-matching problems.