Return
Using fuzzy numbers in knapsack problems
DOI:10.1016/S0377-2217(00)00310-6.png)
Abstract
En 中文
This paper investigates knapsack problems in which all of the weight coefficients are fuzzy numbers. This work is based on the assumption that each weight coefficient is imprecise due to the use of decimal truncation or rough estimation of the coefficients by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. Our work intends to extend the original knapsack problem into a more generalized problem that would be useful in practical situations. As a result, our study shows that the fuzzy knapsack problem is an extension of the crisp knapsack problem, and that the crisp knapsack problem is a special case of the fuzzy knapsack problem. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
fuzzy sets
optimization
knapsack problem
multiconstraint 0/1 knapsack problem
signed distance ranking
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
Translation, Validation and Cross-Cultural Adaptation of a Simplified-Chinese Version of the Tegner Activity Score in Chinese Patients with Anterior Cruciate Ligament Injury
PLOS ONE
IF0

