S,tppose k states form a union and every year a union chairman has Io be selected in stlch a way that at any time the accumulated number of chairmen from each state is proi3ortional 1o ils weight. In this paper a simple algorithm for a chairman assignment is givell which guarantees a small discrepan
β¦ LIBER β¦
On the chairman assignment problem
β Scribed by Rudolf Schneider
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 207 KB
- Volume
- 159
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Given m states, which form a union, every year a chairman has to be selected in such a way that at any time the accumulated number of chairmen from each state is proportional to its weight. In this paper an algorithm for a chairman assignment is given which, depending on the weights, guarantees a small discrepancy.
π SIMILAR VOLUMES
The chairman assignment problem
β
R. Tijdeman
π
Article
π
1980
π
Elsevier Science
π
English
β 258 KB
On the Euclidean assignment problem
β
Franz Rendl
π
Article
π
1988
π
Elsevier Science
π
English
β 591 KB
On solving a variation of the assignment
β
Ronald D Armstrong; Zhiying Jin
π
Article
π
1995
π
Elsevier Science
π
English
β 280 KB
On dual solutions of the linear assignme
β
G. Kindervater; A. Volgenant; G. de Leve; V. van Gijlswijk
π
Article
π
1985
π
Elsevier Science
π
English
β 391 KB
The bottleneck generalized assignment pr
β
Silvano Martello; Paolo Toth
π
Article
π
1995
π
Elsevier Science
π
English
β 949 KB
A note on βthe assignment problem under
β
J. Intrator
π
Article
π
1985
π
Elsevier Science
π
English
β 433 KB