Note: On the greedy algorithm for optimal assembly

DOI10.1002/1520-6750(199210)39:6%3C833::AID-NAV3220390608%3E3.0.CO;2-LMaRDI QIDQ4017558zbMATH OpenOpenAlexFDO

Authors Laurence A. Baxter, Farid Harche

Publication date 16 January 1993

Full work available at URL https://doi.org/10.1002/1520-6750(199210)39:6%3C833::aid-nav3220390608%3E3.0.co;2-l

zbMATH Keywords

balanced algorithmsgreedy algorithmoptimal assemblyoptimal configurationsstructure functions

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Cites work

• Inequalities: theory of majorization and its applications

Cited in

(2)

• A polytope approach to the optimal assembly problem
• Combinatorial Optimization in Pattern Assembly

This page was built for publication: Note: On the greedy algorithm for optimal assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017558)