The aim of this paper is to apply the method of pseudo-Boolean programming to the determination of the minimal cut and of the value of the maximal flow through a network without, or with, given lower ...
This paper investigates a class of single-facility location problems on an arbitrary network. Necessary and sufficient conditions are obtained for characterizing locally optimal locations with respect ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback