A hybrid genetic algorithm for the multidimensional knapsack problem
From MaRDI portal
Recommendations
- A genetic algorithm for the multidimensional knapsack problem
- A genetic algorithm to solve the multidimensional knapsack problem
- scientific article; zbMATH DE number 1910919
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Hybrid genetic algorithms for bin-packing and related problems
Cited in
(11)- A genetic algorithm for the multidimensional knapsack problem
- A genetic algorithm to solve the multidimensional knapsack problem
- Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems
- scientific article; zbMATH DE number 2086191 (Why is no real title available?)
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- scientific article; zbMATH DE number 1114464 (Why is no real title available?)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- Improving the genetic algorithm through new composing of migration and parent centric selection
- A genetic algorithm with fuzzy crossover operator and probability
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the 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: A hybrid genetic algorithm for the multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515603)
