Note: On the greedy algorithm for optimal assembly

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199210)39:6<833::AID-NAV3220390608>3.0.CO;2-L" /><833::AID-NAV3220390608>3.0.CO;2-L 10.1002/1520-6750(199210)39:6<833::AID-NAV3220390608>3.0.CO;2-LzbMath0761.90049OpenAlexW2033037365MaRDI QIDQ4017558

Farid Harche, Laurence A. Baxter

Publication date: 16 January 1993

Full work available at URL: https://doi.org/10.1002/1520-6750(199210)39:6<833::aid-nav3220390608>3.0.co;2-l

zbMATH Keywords

greedy algorithmstructure functionsoptimal assemblyoptimal configurationsbalanced algorithms

Mathematics Subject Classification ID

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

Related Items (1)

A polytope approach to the optimal assembly problem

Cites Work

• Inequalities: theory of majorization and its applications

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