论文信息 - The 0-1 knapsack problem with fuzzy data

The 0-1 knapsack problem with fuzzy data

The 0-1 knapsack problem with imprecise profits and imprecise weights of items is considered. The imprecise parameters are modeled as fuzzy intervals. A method of choosing a solution under the uncertainty is proposed and two methods for solving the constructed models are provided.

Adam Kasperski | Michal Kulej

[1] Dorota Kuchta,et al. A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem , 2002, Fuzzy Sets Syst..

[2] L. Zadeh. Fuzzy sets as a basis for a theory of possibility , 1999 .

[3] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4] Jing-Shing Yao,et al. Using fuzzy numbers in knapsack problems , 2001, Eur. J. Oper. Res..

[5] Masahiro Inuiguchi,et al. Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem , 2000, Fuzzy Sets Syst..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Mitsuo Gen,et al. Fuzzy multiple choice knapsack problem , 1994 .

[8] Francisco Herrera,et al. Fuzzy boolean programming problems with fuzzy costs: A general study , 1996, Fuzzy Sets Syst..

[9] Didier Dubois,et al. Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .

[10] Paolo Toth,et al. New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..