This paper concentrates on the assignment problem where costs are not deterministic numbers but imprecise ones. Here, the elements of the cost matrix of the assignment problem are subnormal fuzzy intervals with increasing linear membership functions, whereas the membership function of the total cost
β¦ LIBER β¦
A labeling algorithm for the sensitivity ranges of the assignment problem
β Scribed by Chi-Jen Lin
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 589 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A labeling algorithm for the fuzzy assig
β
Chi-Jen Lin; Ue-Pyng Wen
π
Article
π
2004
π
Elsevier Science
π
English
β 432 KB
A labeling algorithm to solve the assign
β
Vahid Lotfi
π
Article
π
1989
π
Elsevier Science
π
English
β 747 KB
Determining Type II sensitivity ranges o
β
Chi-Jen Lin
π
Article
π
2011
π
Elsevier Science
π
English
β 332 KB
An algorithm for the traffic assignment
β
AndrΓ©s Weintraub; Jaime GonzΓ‘lez
π
Article
π
1980
π
John Wiley and Sons
π
English
β 667 KB
An algorithm for the multiprocessor assi
β
V.F. Magirou; J.Z. Milis
π
Article
π
1989
π
Elsevier Science
π
English
β 380 KB
A (1β)-approximation algorithm for the g
β
Zeev Nutov; Israel Beniaminy; Raphael Yuster
π
Article
π
2006
π
Elsevier Science
π
English
β 173 KB
We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 1 2