M. Zerafat Angiz L

  • Citations Per Year
Learn More
The existing assignment problems for assigning n jobs to n individuals are limited to the considerations of cost or profit measured as crisp. However, in many real applications, costs are not deterministic numbers. This paper develops a procedure based on Data Envelopment Analysis method to solve the assignment problems with fuzzy costs or fuzzy profits for(More)
We consider the problem of tting an n n distance matrix D by a tree metric T . This problem is NP-hard for most reasonable distance functions between D and T . Recently, an approximation algorithm was presented [1] which achieves a factor of 3 approximation to the L 1 best tting tree. We call this method the Single Pivot (SP) heuristic Within the biology(More)
  • 1