Page 1

Displaying 1 – 6 of 6

Showing per page

On the minimum cost multiple-source unsplittable flow problem

Meriema Belaidouni, Walid Ben-Ameur (2007)

RAIRO - Operations Research

The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here are valid for single knapsack constraints. They are based on nondecreasing superadditive functions and...

Currently displaying 1 – 6 of 6

Page 1