Author:
Hifi Mhand,Mhalla Hedi,Sadfi Slim
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference19 articles.
1. E. Balas and E. Zemel, “An algorithm for large zero-one knapsack problems,” Operations Research, vol. 28, pp. 1130–1154, 1980.
2. P. Chu and J.E. Beasley, “A genetic algorithm for the multidimensional knapsack problem,” Journal of Heuristics, vol. 4, pp. 63–86, 1998.
3. G.B. Dantzig, “Discrete variable extremum problems,” Operations Research, vol. 5, pp. 266–277, 1957.
4. D. Fayard and G. Plateau, “An algorithm for the solution of the 0–1 knapsack problem,” Computing, vol. 28, pp. 269–287, 1982.
5. A. Freville and G. Plateau, “The 0–1 bidimensional knapsack problem: Toward an efficient high-level primitive tool,” Journal of Heuristics, vol. 2, pp. 147–167, 1997.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献