𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the Lorenz measure in locational decisions on trees

✍ Scribed by Oded Maimon

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
723 KB
Volume
9
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An evolutionary algorithm for constructi
An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees
✍ Lior Rokach πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

Decision forest is an ensemble classification method that combines multiple decision trees to in a manner that results in more accurate classifications. By combining multiple heterogeneous decision trees, decision forest is effective in mitigating noise that is often prevalent in real-world classifi

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

A real time algorithm for the location s
A real time algorithm for the location search of discontinuous conductivities with one measurement
✍ Ohin Kwon; Jin Keun Seo; Jeong-Rock Yoon πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 292 KB

## Abstract We consider an inverse problem for finding the anomaly of discontinuous electrical conductivity by one current‐voltage observation. We develop a real time algorithm for determining the location of the anomaly. This new idea is based on the observation of the pattern of a simple weighted

Linear time algorithms for computing the
Linear time algorithms for computing the most reliable source on an unreliable tree network
✍ Xue, Guoliang πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 121 KB πŸ‘ 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a