Technical Note—Branch and Fathom: A Technique for Computing Functions on the Power Set of a Set

David R. Strip
Additional contact information
David R. Strip: Sandia National Laboratories, Albuquerque, New Mexico

Operations Research, 1983, vol. 31, issue 2, 396-400

Abstract: Tree traversal algorithms are frequently used for ordering operations on sets. This paper describes a tree structure and traversal scheme which is applied to the computation of a reliability measure. The key to this variation is a particular labeling of the enumeration tree which locates supersets of a set S in one subtree of the node labeled with S . Exact computation by simple techniques is considerably more time-consuming than by the “branch and fathom” technique, which may also be useful in computing other functions on the power set of a set.

Keywords: 492; branch; and; bound (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.2.396 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:31:y:1983:i:2:p:396-400

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().