Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 76 (1998), S. 95-107 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: 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.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...