The minimum cost multicommodity circulation problem with convex arc-costs is solved by using the negative directed cycles approach. This algorithm is used to compute equilibrium flows in a ...
Previous research on the multicommodity minimum cost flow problem (MMCFP) has assumed that there are two types of values associated with an arc. The first is the capacity of the arc and the second is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results