Matching problems in selective assembly operations

Abstract

We consider several different matching problems that are motivated by applications to selective assembly operations. In the case of maximum cardinality problems, we provide linear time greedy algorithms which we prove optimal via a min-max theorem. We also consider a weighted version and provide a polynomial time algorithm to find the optimal solution.