The objective of this paper is the construction of a branch-and-bound algorithm for computing minimum cost flows in capacitated networks when the cost of passing a flow over an arc is concave. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback