Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
From MaRDI portal
(Redirected from Publication:474490)
Recommendations
- An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
- scientific article; zbMATH DE number 5951334
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
Cites work
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A comparative study of artificial bee colony algorithm
- A genetic algorithm for the multidimensional knapsack problem
- A modified artificial bee colony algorithm
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- An Enumeration Algorithm for Knapsack Problems
- An approximate dynamic programming approach to multidimensional knapsack problems
- An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Two heuristics for the one-dimensional bin-packing problem
Cited in
(4)- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- scientific article; zbMATH DE number 5951334 (Why is no real title available?)
- An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
This page was built for publication: Artificial bee colony algorithm merged with pheromone communication mechanism 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 Q474490)
