| Article ID: | iaor1993649 |
| Country: | United States |
| Volume: | 39 |
| Issue: | 6 |
| Start Page Number: | 833 |
| End Page Number: | 837 |
| Publication Date: | Oct 1992 |
| Journal: | Naval Research Logistics |
| Authors: | Baxter Laurence A., Harche Farid |
The greedy and balanced algorithms for the optimal assembly of arbitrary structure functions (not necessarily binary) are discussed. Conditions under which these algorithms yield optimal configurations are deduced.