Note---A Branch-and-Fathom Algorithm for the Long Range Process Design Problem

Jaya Singhal and Joseph L. Katz
Additional contact information
Jaya Singhal: Department of Information and Quantitative Sciences, University of Baltimore, 1420 N Charles Street, Baltimore, Maryland 21201
Joseph L. Katz: Department of Decision Sciences, Georgia State University, Atlanta, Georgia 30303

Management Science, 1990, vol. 36, issue 4, 513-516

Abstract: Several problems, including the long-range process design problem, have been formulated as a compatibility matrix. Earlier, Singhal et al. (1988) proposed a partial enumeration algorithm which found all feasible designs and reported computational results. However, for large problems, the partial enumeration algorithm requires an excessive amount of computational effort to locate all feasible designs. This paper presents a branch and fathom algorithm which is more efficient than the partial enumeration algorithm, and which significantly reduces the computational effort necessary to identify all feasible designs.

Keywords: compatibility matrix; process design; branch-and-fathom methods; mathematics-combinatorics; research and development (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.36.4.513 (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:ormnsc:v:36:y:1990:i:4:p:513-516

Access Statistics for this article

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