Approximating Multi-objective Knapsack Problems

This publication has 9 references indexed in Scilit:

• On the approximability of trade-offs and optimal access of Web sources
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Dynamic programming approaches to the multiple criteria knapsack problem
  Naval Research Logistics (NRL), 2000
• Multicriteria Optimization
  Published by Springer Nature ,2000
• Dynamic Programming Revisited: Improving Knapsack Algorithms
  Computing, 1999
• Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
  IEEE Transactions on Evolutionary Computation, 1999
• A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
  Journal of Combinatorial Optimization, 1999
• Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
  European Journal of Operational Research, 1984
• A fully polynomial approximation algorithm for the 0–1 knapsack problem
  European Journal of Operational Research, 1981
• ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES11Supported by Sonderforschungsbereich 21 (DFG), Institut für Operations Research, Universität Bonn.
  Published by Elsevier ,1981