Average time per problem was less than a second, and the maximum time for any single problem was 3 seconds. Value-independent 0-1 knapsack problems (also randomly generated), were solved with a ...

For the multiobjective one-dimensional knapsack problem, a practical fully polynomialtime approximation scheme (FPTAS) is derived. It is based on a new approach to the single-objective knapsack ...