Premium
Note: On the greedy algorithm for optimal assembly
Author(s) -
Baxter Laurence A.,
Harche Farid
Publication year - 1992
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199210)39:6<833::aid-nav3220390608>3.0.co;2-l
Subject(s) - greedy algorithm , mathematical optimization , greedy randomized adaptive search procedure , yield (engineering) , binary number , computer science , algorithm , mathematics , materials science , arithmetic , metallurgy
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. © 1992 John Wiley & Sons, Inc.