A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
| Autor: | Sverre Storøy, Olof Damberg, Tor Sørevik |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Linear bottleneck assignment problem
Control and Optimization Theoretical computer science Computer science Applied Mathematics Parallel algorithm Computational Mathematics Path (graph theory) Many to one Bipartite graph Algorithm Assignment problem Generalized assignment problem Weapon target assignment problem |
| Zdroj: | Computational Optimization and Applications. 6:251-272 |
| ISSN: | 1573-2894 0926-6003 |
| DOI: | 10.1007/bf00247794 |
| Popis: | The purpose of this study is to describe a data parallel primal-dual augmenting path algorithm for the dense linear many-to-one assignment problem also known as semi-assignment. This problem could for instance be described as assigning n persons to m(≤n) job groups. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink