Accession Number:

AD0656608

Title:

AN IMPROVED METHOD OF FINDING ALL LARGEST COMBINABLE CLASSES,

Descriptive Note:

Corporate Author:

ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s):

Report Date:

1967-08-01

Pagination or Media Count:

28.0

Abstract:

Several algorithms, such as a row-column minimization algorithm and an asynchronous machine assignment algorithm, require finding the largest sets of combinable elements from a list of pairwise combinable elements. The paper presents a technique for finding these sets which is generally faster than the one presently in use. Further, the presentation of this technique uncovers an interesting theory about combinability.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE