Approximating Multiobjective Knapsack Problems

References

• Ehrgott M. Lecture Notes in Economics and Mathematical Systems. Multicriteria Optimization (2000) 491(Springer)Crossref, Google Scholar
• Ehrgott M., X. Gandibleux. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum (2000) 22:425–460Crossref, Google Scholar
• Frieze A., Clarke M. Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses. Eur. J. Oper. Res. (1984) 15:100–109Crossref, Google Scholar
• Ibarra O. H., Kim C. E. Fast approximation algorithms for the knapsack and sum of subset problem. J. ACM (1984) 22:463–468Crossref, Google Scholar
• Kellerer H., Pferschy U. A new fully polynomial time approximation scheme for the knapsack problem. J. Combin. Optim. (1999) 3:59–71Crossref, Google Scholar
• Kellerer H., Pferschy U. Improved dynamic programming in connection with an FPTAS for the knapsack problem. J. Combin. Optim. (2002) . ForthcomingGoogle Scholar
• Khachian L. G. A polynomial algorithm in linear programming. Soviet Math. Doklady (1979) 20:191–194Google Scholar
• Klamroth K., Wiecek M. M. Dynamic programming approaches to the multiple criteria knapsack problem. Naval Res. Logist (2000) 47:57–76Crossref, Google Scholar
• Korte B., Schrader R., Mangasarian O. L., Meyer R. R., Robinson S. M. On the existence of fast approximation schemes. Nonlinear Programming (1981) 4(Academic Press)415–437Google Scholar
• Magazine M. J., Oguz O. A fully polynomial approximation algorithm for the 0–1 knapsack problem. Eur. J. Oper. Res. (1981) 8:270–273Crossref, Google Scholar
• Martello S., Toth P.Knapsack Problems (1990) (John Wiley and Sons, New York) Google Scholar
• Papadimitriou C. H., Yannakakis M. On the approximability of trade-offs and optimal access of Web sources. Proc. 41st Ann. Sympos. Foundations Comput. Sci. FOCS'00 (2000) Redondo Beach, CA:86–92Crossref, Google Scholar
• Pferschy U. Dynamic programming revisited: Improving knapsack algorithms. Comput. (1999) 63:419–430Crossref, Google Scholar
• Safer H. M., Orlin J. B. Fast approximation schemes for multi-criteria combinatorial optimization. (1995a) . Working paper 3756–95, MIT Sloan School of Management, Cambridge, MAGoogle Scholar
• Safer H. M., Orlin J. B. Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. (1995b) . Working paper 3757–95, MIT Sloan School of Management, Cambridge, MAGoogle Scholar
• Zitzler E., Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Trans. Evolutionary Comput. (1999) 3:257–271Crossref, Google Scholar