Abstract | ||
---|---|---|
We consider the problem of testing sequentially the components of a multi-component reliability system in order to figure
out the state of the system via costly tests. In particular, systems with identical components are considered. The notion
of lexicographically large binary decision trees is introduced and a heuristic algorithm based on that notion is proposed.
The performance of the heuristic algorithm is demonstrated by computational results, for various classes of functions. In
particular, in all 200 random cases where the underlying function is a threshold function, the proposed heuristic produces
optimal solutions. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/s10878-005-4106-4 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
sequential testing,boolean functions,binary decision trees | Boolean function,Decision tree,Combinatorics,Mathematical optimization,Heuristic,Heuristic (computer science),Algorithm,Binary decision diagram,Binary tree,Lexicographical order,Mathematics,Consistent heuristic | Journal |
Volume | Issue | ISSN |
10 | 3 | 1382-6905 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tonguç Ünlüyurt | 1 | 102 | 8.94 |