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 ...
This paper is concerned with the identification of the closest strong efficient target of a Decision Making Unit (DMU) in the Free Disposal Hull (FDH) technology in Data Envelopment Analysis (DEA).
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback