A New Artificial Fish Swarm Algorithm for the Multiple Knapsack Problem
Open Access
- 1 January 2014
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E97.D (3) , 455-468
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A polynomial algorithm for the multiple knapsack problem with divisible item sizesInformation Processing Letters, 2009
- An exact algorithm for the fixed-charge multiple knapsack problemEuropean Journal of Operational Research, 2009
- Ants and Multiple Knapsack Problem2007
- Upper bounds and algorithms for the maximum cardinality bin packing problemEuropean Journal of Operational Research, 2003
- Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible DemandElectronic Commerce Research, 2001
- An exact algorithm for large multiple knapsack problemsEuropean Journal of Operational Research, 1999
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Heuristic algorithms for the multiple knapsack problemComputing, 1981
- Reducibility among Combinatorial Problems1972
- The Loading ProblemManagement Science, 1971