Mette Gamst

  • Citations Per Year
Learn More
The Multicommodity Flow Problem (MCFP) considers the efficient routing of commodities from their origins to their destinations, subject to capacity restrictions and edge costs. This paper studies the NP-hard Minimum Cost Multicommodity k-splittable Flow Problem in which each commodity may use at most k paths between its origin and its destination. The(More)
Here X is a vector of variables, all lying in the set S. The cost vector is denoted c. A is a matrix, b a vector, and together they form the constraints on the variables. When S is the set of real numbers, the mathematical model is said to be a linear program (LP). If S is a binary set or the set of integers, the problem is an integer program (IP). If some(More)
  • 1