Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm
From MaRDI portal
Publication:2093908
Recommendations
- A genetic algorithm to solve the multidimensional knapsack problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- scientific article; zbMATH DE number 1910919
- A genetic algorithm for the multidimensional knapsack problem
- Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using -dominance
Cited in
(2)
This page was built for publication: Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093908)