Matching problems in selective assembly operations

DOI10.1023/A:1018960924601MaRDI QIDQ1383124zbMATH OpenFDO

Authors A. B. Gamble, Collette R. Coullard, Philip C. Jones

Publication date 2 April 1998

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

matching problemsselective assemblymaximum cardinalitylinear time greedy algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Production models (90B30)

Recommendations

• A fast bipartite network flow algorithm for selective assembly
• Matching problems with generalized upper bound side constraints
• scientific article; zbMATH DE number 1953187
• scientific article; zbMATH DE number 4116586

Cited in

(5)

• scientific article; zbMATH DE number 1389745 (Why is no real title available?)
• scientific article; zbMATH DE number 842132 (Why is no real title available?)
• A fast bipartite network flow algorithm for selective assembly
• Optimal matching of random parts
• Minimum-error classes for matching parts

This page was built for publication: Matching problems in selective assembly operations

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