Author:
Liu Jianjun,Wu Changzhi,Cao Jiang,Wang Xiangyu,Teo Kok Lay
Funder
Natural Science Foundation of China
Australian Research Council
Subject
Applied Mathematics,Modelling and Simulation
Reference44 articles.
1. Approximation algorithms for the m-dimensional 0–1 knapsack problem: worst-case and probabilistic analyses;Frieze;Eur. J. Oper. Res.,1984
2. A survey of effective heuristics and their application to a variety of knapsack problems;Wilbaut;IMA J. Manag. Math.,2008
3. The knapsack-lightening problem and its application to scheduling HRT tasks;Nawrocki;Bull. Polish Acad. Sci.: Tech. Sci.,2009
4. Optimizations in project scheduling: a state-of-art survey;Wu,2014
5. The multidimensional knapsack problem: structure and algorithms;Puchinger;INFORMS J. Comput.,2010
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献