Approximating Multi-objective Knapsack Problems
- 2 August 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 210-221
- https://doi.org/10.1007/3-540-44634-6_20
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the approximability of trade-offs and optimal access of Web sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamic programming approaches to the multiple criteria knapsack problemNaval Research Logistics (NRL), 2000
- Multicriteria OptimizationPublished by Springer Nature ,2000
- Dynamic Programming Revisited: Improving Knapsack AlgorithmsComputing, 1999
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- A New Fully Polynomial Time Approximation Scheme for the Knapsack ProblemJournal of Combinatorial Optimization, 1999
- Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analysesEuropean Journal of Operational Research, 1984
- A fully polynomial approximation algorithm for the 0–1 knapsack problemEuropean 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