AN IMPROVED METHOD OF FINDING ALL LARGEST COMBINABLE CLASSES,
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Pagination or Media Count:
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.
- Operations Research