Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights
From MaRDI portal
(Redirected from Publication:965587)
Recommendations
Cites work
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3518800 (Why is no real title available?)
- A characterization of the extension principle
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A new variable reduction technique for convex integer quadratic programs
- A note on the extension principle for fuzzy sets
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Evolutionary algorithm solution to fuzzy problems: fuzzy linear programming
- Fuzzy sets as a basis for a theory of possibility
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Integer knapsack problems with set-up weights
- Using fuzzy numbers in knapsack problems
Cited in
(3)
This page was built for publication: Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965587)