Intuitionistic Fuzzy Assignment Problem: An Application in Agriculture
M. A. Lone, S. A. Mir, Y. Ismail, R. Majid
Asian Journal of Agricultural Extension, Economics & Sociology · pp. 1–6 · Published 18 Mar 2017
10.9734/AJAEES/2017/31967Abstract
Assignment problem is a well known and most suited for solving real world problems. This paper deals with Intuitionistic fuzzy assignment problem whose cost has been considered as an Intuitionistic triangular fuzzy numbers. By defuzzifying, the assignment costs are converted into crisp values and the optimum solution is obtained by using Branch and Bound method.
Cited by 4
Krishna Prabha Sikkannan, Vimala Shanmugavel · 2020
P. Senthil Kumar · Theoretical and Applied Mathematics in International Business · 2020
S. Prabha, S. Vimala · 2018
Subadhra Srinivas, K. Prabakaran · Yugoslav Journal of Operations Research · 2025
Related research
- An Application of Assignment Problem in Agriculture Using R — shares topic coverage
- Genetic Algorithm Based Hybrid Approach to Solve Optimistic, Most-likely and Pessimistic Scenarios of Fuzzy Multi-objective Assignment Problem Using Exponential Membership Function — shares topic coverage
- The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications — shares topic coverage
- The Out-of-Kilter Algorithm and Its Applications to Network Flow Problems — shares topic coverage
- Alternate Approach (Penalty Approach) to Assignment Problem Solving and Comparison to Existing Approaches — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
4
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.