Downloads provided by UsageCounts
doi: 10.5281/zenodo.2827461 , 10.5281/zenodo.2864705 , 10.5281/zenodo.2668886 , 10.5281/zenodo.2666220 , 10.5281/zenodo.2666221 , 10.5281/zenodo.2665190 , 10.5281/zenodo.2671921 , 10.5281/zenodo.2819031 , 10.5281/zenodo.2861736 , 10.5281/zenodo.2837181 , 10.5281/zenodo.2812238 , 10.5281/zenodo.2837182 , 10.5281/zenodo.2830134 , 10.5281/zenodo.2823937 , 10.5281/zenodo.2864704 , 10.5281/zenodo.2663271 , 10.5281/zenodo.2861735 , 10.5281/zenodo.2839790 , 10.5281/zenodo.2671920 , 10.5281/zenodo.2668887 , 10.5281/zenodo.2664230 , 10.5281/zenodo.2823938 , 10.5281/zenodo.2662656 , 10.5281/zenodo.2827462 , 10.5281/zenodo.2839789 , 10.5281/zenodo.2665191 , 10.5281/zenodo.2830135 , 10.5281/zenodo.2664231 , 10.5281/zenodo.2813615 , 10.5281/zenodo.2662257 , 10.5281/zenodo.2663272 , 10.5281/zenodo.2824852 , 10.5281/zenodo.2662256 , 10.5281/zenodo.2824851 , 10.5281/zenodo.2812237 , 10.5281/zenodo.2661601 , 10.5281/zenodo.2662657 , 10.5281/zenodo.2661600 , 10.5281/zenodo.2819030 , 10.5281/zenodo.2813616
doi: 10.5281/zenodo.2827461 , 10.5281/zenodo.2864705 , 10.5281/zenodo.2668886 , 10.5281/zenodo.2666220 , 10.5281/zenodo.2666221 , 10.5281/zenodo.2665190 , 10.5281/zenodo.2671921 , 10.5281/zenodo.2819031 , 10.5281/zenodo.2861736 , 10.5281/zenodo.2837181 , 10.5281/zenodo.2812238 , 10.5281/zenodo.2837182 , 10.5281/zenodo.2830134 , 10.5281/zenodo.2823937 , 10.5281/zenodo.2864704 , 10.5281/zenodo.2663271 , 10.5281/zenodo.2861735 , 10.5281/zenodo.2839790 , 10.5281/zenodo.2671920 , 10.5281/zenodo.2668887 , 10.5281/zenodo.2664230 , 10.5281/zenodo.2823938 , 10.5281/zenodo.2662656 , 10.5281/zenodo.2827462 , 10.5281/zenodo.2839789 , 10.5281/zenodo.2665191 , 10.5281/zenodo.2830135 , 10.5281/zenodo.2664231 , 10.5281/zenodo.2813615 , 10.5281/zenodo.2662257 , 10.5281/zenodo.2663272 , 10.5281/zenodo.2824852 , 10.5281/zenodo.2662256 , 10.5281/zenodo.2824851 , 10.5281/zenodo.2812237 , 10.5281/zenodo.2661601 , 10.5281/zenodo.2662657 , 10.5281/zenodo.2661600 , 10.5281/zenodo.2819030 , 10.5281/zenodo.2813616
The primary objective of the paper is to propose a new method for solving assignment problem under uncertain situation. In the classical assignment problem ( ), denotes the cost for assigning the job to the person which is deterministic in nature. Here in some uncertain situation, we have assigned a cost in the form of composite relative degree instead of and this replaced cost is in the maximization form. In this paper, it has been solved and validated by the two proposed algorithms, a new mathematical formulation of assignment problem has been presented where the cost has been considered to be an IVIFN and the membership of elements in the set can be explained by positive and negative evidences. To determine the composite relative degree of similarity of the concept of similarity measure and the score function is used for validating the solution which is obtained by Composite relative similarity degree method. Further, hypothetical numeric illusion is conducted to clarify the method's effectiveness and feasibility developed in the study. Finally, conclusion and suggestion for future work are also proposed.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 10 | |
| downloads | 9 |

Views provided by UsageCounts
Downloads provided by UsageCounts