Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms (Q4834075)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 758168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms |
scientific article; zbMATH DE number 758168 |
Statements
Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms (English)
0 references
25 October 1995
0 references
multiconstraint zero-one knapsack problem
0 references
NP-hard
0 references
genetic algorithms
0 references
heuristic
0 references
local search improvement
0 references
0.8489832282066345
0 references
0.8269095420837402
0 references
0.8248750567436218
0 references
0.8210026025772095
0 references
