A feasible solution is a subset S of the given items satisfying the weight constraint EiES wi < c. In the more general multiobjective m-dimensional knapsack ...
scholar.google.com › citations
The multi-objective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values. For this problem, ...
The multiobjective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values. For this problem, ...
The multiobjective knap- sack problem is a generalization of the classical knapsack problem in which each item has several profit values. For this problem, ...
Missing: Multi- | Show results with:Multi-
The multi-objective knapsack problem is a general- ization of the classical knapsack problem in which each item has sev- eral profit values. For this problem, ...
This paper designs multiple sets of multi-objective knapsack combinatorial optimization problems ... The first step in calculating the weighted crowding distance ...
Approximating single- and multi-objective nonlinear sum and ...
www.sciencedirect.com › article › pii
We present a fully polynomial-time approximation scheme (FPTAS) for a very general version of the well-known knapsack problem.
The multiobjective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values. For this problem, ...
In this paper we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or to approximate the set of efficient solutions.
The multiobjective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values.
Missing: Multi- | Show results with:Multi-