Digitale Medien
Springer
Annals of operations research
76 (1998), S. 95-107
ISSN:
1572-9338
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
,
Wirtschaftswissenschaften
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1023/A:1018960924601
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |