Matching problems in selective assembly operations

DOI10.1023/A:1018960924601zbMath0896.90114MaRDI QIDQ1383124

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) Production models (90B30) Combinatorial optimization (90C27)

Related Items (2)

Minimum-error classes for matching parts ⋮ A fast bipartite network flow algorithm for selective assembly

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