Matching problems in selective assembly operations

DOI10.1023/A:1018960924601zbMATH Open0896.90114MaRDI QIDQ1383124FDOQ1383124

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)

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

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)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)