The binary knapsack problem with qualitative levels
From MaRDI portal
Abstract: A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this relation defines a preorder. We propose a dynamic programming algorithm to compute the entire set of non-dominated rank cardinality vectors and we state two greedy algorithms, which efficiently compute a single efficient solution.
Recommendations
- scientific article; zbMATH DE number 3847214
- Bilevel programming with knapsack constraints
- A complexity and approximability study of the bilevel knapsack problem
- An exact algorithm for bilevel 0-1 knapsack problems
- scientific article; zbMATH DE number 3984973
- Bilevel knapsack with interdiction constraints
- Quadratic bottleneck knapsack problems
- On the multiperiod binary knapsack problem
- scientific article; zbMATH DE number 3900493
- Binary knapsack problems with random budgets
Cites work
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- A decision model for technology selection in the existence of both cardinal and ordinal data
- A fuzzy DEA and knapsack formulation integrated model for project selection
- A vague set based decision support approach for evaluating research funding programs
- Approximation schemes for the parametric knapsack problem
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Identifying and Structuring Values to Guide Integrated Resource Planning at BC Gas
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Multicriteria Optimization
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Ordinal criteria in stochastic multicriteria acceptability analysis (SMAA)
- Portfolio decision analysis. Improved methods for resource allocation.
- Preference programming for robust portfolio modeling and project selection
- Preference structures and their numerical representations
- Robust portfolio modeling with incomplete cost information and project interdependencies
- Shortest paths with ordinal weights
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
- The 0-1 knapsack problem with fuzzy data
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Using fuzzy numbers in knapsack problems
Cited in
(7)- Greedy algorithms for a class of knapsack problems with binary weights
- Knapsack problems with dependencies through non-additive measures and Choquet integral
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Multi-objective matroid optimization with ordinal weights
- Ordinal optimization through multi-objective reformulation
- On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
This page was built for publication: The binary knapsack problem with qualitative levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029032)
