REFERENCES
- [1] Andreae, T. 2001. On the travelling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks, 38: 59-67.
- [2] Blaser, M., Manthey, B., and Sgall, J. 2006. An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms, 4: 623-632.
- [3] Bockenhauer, H. J., Hromkovi, J., Klasing, R., Seibert, S., and Unger, W. 2002. Towards the notion of stability of approximation for hard optimization tasks and the travelling salesman proble-m. Theoretical Computer Science, 285: 3-24.
- [4] Chandran, L. S. and Ram, L. S. 2007. On the relationship between ATSP and the cycle cover problem. Theoretical Computer Science, 370: 218-228.
- [5] Chen, M. S. 1985. On a fuzzy assignment problem. Tamkang J., 22: 407-411.
- [6] Crisan, G. C. and Nechita, E. 2008. Solving Fuzzy TSP with Ant Algorithms. International Journal of Computers, Communications and Control, III (Suppl. issue: Proceedings of ICCCC 2008), 228-231.
- [7] Dubois, D. and Prade, H. 1980. “Fuzzy Sets and Systems: Theory and Applications”. New York.
- [8] Feng, Y. and Yang, L. 2006. A two-objective fuzzy k-cardinality assignment problem. Journal of Computational and Applied Mathematics, 197: 233-244.
- [9] Fischer, R. and Richter, K. 1982. Solving a multiobjective travelling salesman problem by dynamic programming. Optimization, 13: 247-252.
- [10] Kuhn, H. W. 1955. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2: 83-97.
- [11] Lin, C. J. and Wen, U. P. 2004. A labeling algorithm for the fuzzy assignment problem. Fuzzy Sets and Systems, 142: 373-391.
- [12] Liu, L. and Gao, X. 2009. Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm. Applied Mathematical Modelling, 33: 3926-3935.
- [13] Majumdar, J. and Bhunia, A. K. 2007. Elitist genetic algorithm for assignment problem with imprecise goal. European Journal of Operational Research, 177: 684-692.
- [14] Melamed, I. I. and Sigal, I. K. 1997. The linear convolution of criteria in the bicriteria travelling salesman problem. Computational Mathematics and Mathematical Physics, 37: 902-905.
- [15] Mukherjee S. and Basu, K. 2010. Application of fuzzy ranking method for solving assignment problems with fuzzy costs. International Journal of Computational and Applied Mathematics, 5: 359-368.
- [16] Padberg, M. and Rinaldi, G. 1987. Optimization of a 532-city symmetric travelling salesman problem by branch and cut. Operations Research Letters, 6: 1-7.
- [17] Rehmat, A., Saeed H., and Cheema, M. S. 2007. Fuzzy multi-objective linear programming approach for travelling salesman problem. Pakistan Journal of Statistics and Operation Research, 3: 87-98.
- [18] Sakawa, M., Nishizaki, I., and Uemura, Y. 2001. Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: a case study. European Journal of Operational Research, 135: 142-157.
- [19] Sengupta, A. and Pal, T. K. 2009. “Fuzzy Preference Ordering of Interval Numbers in Decision Problems”. Berlin.
- [20] Sigal, I. K. 1994. An algorithm for solving large-scale travelling salesman problem and its numerical implementation. USSR Computational Mathematics and Mathematical Physics, 27: 121-127.
- [21] Wang, X. 1987. Fuzzy optimal assignment problem. Fuzzy Math., 3: 101-108.
- [22] Yager, R. R. 1981. A procedure for ordering fuzzy subsets of the unit interval. Information Sciences, 24: 143-161.
- [23] Ye, X. and Xu, J. 2008. A fuzzy vehicle routing assignment model with connection network based on priority-based genetic algorithm. World Journal of Modelling and Simulation, 4: 257-268.
- [24] Zadeh, L. A. Fuzzy sets. Information and Control, 8: 338-353.
- [25] Zimmermann, H. J. 1996. “Fuzzy Set Theory and its Application”. Boston.