Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems
- 1 February 2014
- journal article
- Published by Elsevier BV in Swarm and Evolutionary Computation
- Vol. 14, 66-75
- https://doi.org/10.1016/j.swevo.2013.09.002
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problemEuropean Journal of Operational Research, 2008
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive toolJournal of Heuristics, 1996
- A statistical analysis of the knapsack problemJournal of Physics A: General Physics, 1995
- The growth of m-constraint random knapsacksEuropean Journal of Operational Research, 1990
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimalityMathematical Programming, 1985
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack ProblemJournal of the Operational Research Society, 1979
- Zero-one programming with many variables and few constraintsEuropean Journal of Operational Research, 1978
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- Methods for the Solution of the Multidimensional 0/1 Knapsack ProblemOperations Research, 1967