Interval routing is a space-efficient routing method for computer networks. The method is said to be optimal if it can generate optimal routing paths for any source-destination node pair. A path is optimal if it is a shortest path between the two nodes involved. A seminal result (The Computer Journal, 34 (1991), 475–476) in the area, however, has pointed out that “the interval routing algorithm...

0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.03.039 * Corresponding author. E-mail address: [email protected] (P.J. Korho 1 The term ‘‘radial” in the traditional DEA-literature reach the efficient frontier by proportionally increasi outputs or decreasing the values of the current inputs We develop an approach to efficiency analysis to enable us to incorporate in...

data envelopment analysis (dea) is a mathematical programming-based approach for evaluates the relative efficiency of a set of dmus (decision making units). the relative efficiency of a dmu is the result of comparing the inputs and outputs of the dmu and those of other dmus in the pps (production possibility set). also, in data envelopment analysis various models have been developed in order to...

Data envelopment analysis (DEA) is a technique for measuring the efficiency of decision making units. In all models of the DEA, for each unit under assessment, the numerical efficiency is obtained which may be less than or equal to one. Given the possible large number of functional units, we use various ranking methods for evaluating units. One of the rating methods is Balance index and Topsis....

This paper proposes a simple and efficient method to numerically obtain the mapping degree deg( f , 0, B) of a C1 map f : Rn → Rn at a regular value 0 relative to a bounded open subset B ⊂ Rn. For practical application, this method adopts Aberth’s algorithm which does not require computation of derivatives and determinants, and reduces the computational cost with two additional procedures, name...

In this paper, interval Legendre wavelet method is investigated to approximated the solution of the interval Volterra-Fredholm-Hammerstein integral equation. The shifted interval Legendre polynomials are introduced and based on interval Legendre wavelet method is defined. The existence and uniqueness theorem for the interval Volterra-Fredholm-Hammerstein integral equations is proved. Some examp...

0

recently the concept of facility efficiency, which defined by data envelopment analysis (dea), introduced as a location modeling objective, that provides facilities location’s effect on their performance in serving demands. by combining the dea models with the location problem, two types of “efficiencies” are optimized: spatial efficiency which measured by finding the least cost location and al...