Using fuzzy numbers in knapsack problems
From MaRDI portal
Publication:5954834
DOI10.1016/S0377-2217(00)00310-6zbMath1077.90563OpenAlexW2093966265MaRDI QIDQ5954834
No author found.
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00310-6
Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (9)
A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem ⋮ A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm ⋮ Intuitionistic fuzzy knapsack problem trough the index matrices prism ⋮ An ant colony optimization approach for binary knapsack problem under fuzziness ⋮ Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms ⋮ Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights ⋮ A fuzzy DEA and knapsack formulation integrated model for project selection ⋮ The binary knapsack problem with qualitative levels ⋮ The 0-1 knapsack problem with fuzzy data
Uses Software
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 general model for fuzzy linear programming
- Heuristic algorithms for the multiple knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Ranking fuzzy numbers based on decomposition principle and signed distance.
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
This page was built for publication: Using fuzzy numbers in knapsack problems
