## 4 0/1-mKP Solving by Multi-DPT-List\({}_{\text{TSR}}\) Plus Unbiased Filtering in Efficient Time
### Efficient Multi-DPT-List\({}_{\text{TSR}}\) Algorithm for Solving 0/1-mKP
#### 4.1.2 The Exact-Fit (Best) Knapsack Order for Regular and Irregular Datasets
Syst._**2009**, _25_, 35-50. [CrossRef]* (4) [PERSON] A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model. _Expert Syst. Appl._**2011**, _38_, 12415-12422. [CrossRef]
* (5) [PERSON]; [PERSON]; [PERSON]. A knapsack problem as a tool to solve the production planning problem in small foundries. _Comput. Oper. Res._**2012**, _39_, 86-92. [CrossRef]
* (6) [PERSON]; [PERSON] Bin completion algorithms for multicontainer packing, knapsack, and covering problems. _J. Artif. Intell. Res._**2007**, _28_, 393-429. [CrossRef]
* (7) [PERSON]; [PERSON] [PERSON] Robust optimization of the 0-1 knapsack problem: Balancing risk and return in assortment optimization. _Eur. J. Oper. Res._**2016**, _250_, 842-854. [CrossRef]
* (8) [PERSON]; [PERSON]; [PERSON]; [PERSON] Delay optimization using Knapsack algorithm for multimedia traffic over MANETs. _Expert Syst. Appl._**2015**, _42_, 6819-6827. [CrossRef]
* (9) [PERSON]; [PERSON]; [PERSON] Knapsack-based buffer management strategy for delay-tolerant networks. _J. Parallel Distrib. Comput._**2015**, _86_, 1-15. [CrossRef]
* (10) [PERSON]; [PERSON]; [PERSON]; [PERSON] Combination of genetic network programming and knapsack problem to support record clustering on distributed databases. _Expert Syst. Appl._**2016**, _46_, 15-23. [CrossRef]
* (11) [PERSON]; [PERSON]; [PERSON] Dynamic Programming. In _Knapsack Problem_; Springer: Berlin, Germany; New York, NY, USA, 2004; pp. 20-26. * (12) [PERSON]; [PERSON] [PERSON]; [PERSON] Exact solution of the robust knapsack problem. _Comput. Oper. Res._**2013**, _40_, 2625-2631. [CrossRef] [PubMed]
* (13) [PERSON]; [PERSON]; [PERSON] Dynamic programming based algorithms for the discounted {0-1} knapsack problem. _Appl. Math. Comput._**2012**, _218_, 6921-6933. [CrossRef]
* (14) [PERSON]; [PERSON]; [PERSON] A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem. _Comput. Math. Appl._**2011**, _62_, 2913-2930. [CrossRef]
* (15) [PERSON]; [PERSON] Dynamic programming algorithms for the bi-objective integer knapsack problem. _Eur. J. Oper. Res._**2014**, _236_, 85-99. [CrossRef]
* (16) [PERSON]; [PERSON]; [PERSON]; [PERSON] A new lagrangian based branch and bound algorithm for the 0-1 knapsack problem. _Electron. Notes Discret. Math._**2010**, _36_, 623-630. [CrossRef]
* (17) [PERSON]; [PERSON] On exponential time lower bound of knapsack under backtracking. _Theor. Comput. Sci._**2010**, _411_, 1883-1888. [CrossRef]
* (18) [PERSON]; [PERSON]. Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. _Oper. Res. Lett._**2003**, _31_, 202-210. [CrossRef]
* (19) [PERSON]; [PERSON]; [PERSON] Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem. _Appl. Soft Comput._**2013**, _13_, 1774-1780. [CrossRef]
* (20) [PERSON]; [PERSON] An algorithm for large zero-one knapsack problems. _Oper. Res._**1980**, _28_, 1130-1154. [CrossRef]
* (21) [PERSON]; [PERSON]; [PERSON] Adaptive kernal search: A heuristic for solving mixed integer linear programs. _Eur. J. Oper. Res._**2017**, _263_, 789-804. [CrossRef]
* (22) [PERSON]; [PERSON]; [PERSON] Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm. _Expert Syst. Appl._**2016**, _54_, 241-250. [CrossRef]
* (23) [PERSON]; [PERSON] An improved approach for solving 0/1 knapsack problem in polynomial time using genetic algorithms. In Proceedings of the IEEE International Conference on Recent Advances and Innovations in Engineering, Jaipur, India, 9-11 May 2014. * (24) [PERSON]; [PERSON] A modified binary particle swarm optimization for knapsack problems. _Appl. Math. Comput._**2012**, _218_, 11042-11061. [CrossRef]
* (25) [PERSON]; [PERSON] Shuffled frog leaping algorithm and its application to 0/1 knapsack problem. _Appl. Soft Comput._**2014**, _19_, 252-263. [CrossRef]
* (26) [PERSON] Soccer league competition algorithm for solving knapsack problem. _Swarm Evol. Comput._**2015**, _20_, 14-22.