Approximating Multi-objective Knapsack Problems
暂无分享,去创建一个
[1] H. Safer. Fast approximation schemes for multi-criteria combinatorial optimization , 1992 .
[2] J. Orlin,et al. Fast Approximation Schemes for Multi-Criteria Flow, Knapsack, and Scheduling Problems , 1995 .
[3] Hans Kellerer,et al. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..
[4] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .
[5] M. Wiecek,et al. Dynamic programming approaches to the multiple criteria knapsack problem , 2000 .
[6] Osman Oguz,et al. A fully polynomial approximation algorithm for the 0-1 knapsack problem , 1981 .
[7] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[8] Marc Pirlot. Multicriteria optimisation, Lecture notes in economics and mathematical systems 491: Matthias Ehrgott; Springer, Berlin, 2000, 243pp., index, price 91.90 DM, softcover, ISBN 3-540-67869-7 , 2003 .
[9] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[10] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[11] A. Frieze,et al. Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .