Author:
Adouani Yassine,Jarboui Bassem,Masmoudi Malek
Publisher
Springer International Publishing
Reference37 articles.
1. Akcay, Y., Li, H., Xu, S.H.: Greedy algorithm for the general multidimensional knapsack problem. Ann. Oper. Res. 150, 7–29 (2007)
2. Akinc, U.: Approximate and exact algorithms for the fixed-charge knapsack problem. Eur. J. Oper. Res. 170, 363–375 (2006)
3. AlMaliky, F., Hifi, M., Mhalla, H.: Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. Int. Trans. Oper. Res. 25, 637–666 (2018)
4. Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218, 11042–11061 (2012)
5. Billionnet, A., Soutif, E.: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 157, 565–575 (2004)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献