Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
From MaRDI portal
Recommendations
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- A genetic algorithm to solve the multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- scientific article; zbMATH DE number 1910919
- scientific article; zbMATH DE number 1703850
Cites work
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Greedy algorithm for the general multidimensional knapsack problem
- scientific article; zbMATH DE number 423663 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3240118 (Why is no real title available?)
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
Cited in
(1)
This page was built for publication: Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855721)