We consider the piecewise linear multicommodity network flow problem with the addition of a constraint specifying that the total flow on each arc must be an integer. This problem has many applications ...
The knapsack sharing problem has a utility or tradeoff function for each variable and seeks to maximize the value of the smallest tradeoff function (a maximin objective function). A single constraint ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback