Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights

DOI10.1016/j.apm.2008.10.004zbMath1205.90241OpenAlexW2083471352MaRDI QIDQ965587

Shih-Pin Chen

Publication date: 24 April 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2008.10.004

zbMATH Keywords

parametric programmingfuzzy setsresource allocationknapsack problemmembership function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (1)

An ant colony optimization approach for binary knapsack problem under fuzziness

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• A characterization of the extension principle
• Fuzzy sets as a basis for a theory of possibility
• A note on the extension principle for fuzzy sets
• A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem
• Evolutionary algorithm solution to fuzzy problems: fuzzy linear programming
• A new variable reduction technique for convex integer quadratic programs
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Integer knapsack problems with set-up weights
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Using fuzzy numbers in knapsack problems

This page was built for publication: Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights