An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
From MaRDI portal
Recommendations
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- scientific article; zbMATH DE number 5951334
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
Cited in
(11)- scientific article; zbMATH DE number 6263318 (Why is no real title available?)
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
- scientific article; zbMATH DE number 5811885 (Why is no real title available?)
- scientific article; zbMATH DE number 5951334 (Why is no real title available?)
- Improved artificial bee colony algorithm for global optimization
- A RNN-based hyper-heuristic for combinatorial problems
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
This page was built for publication: An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058830)