Keywords
Knapsack problemContinuous knapsack problemComputer scienceCombinatorial optimizationMathematical optimizationConstraint (computer-aided design)Cutting stock problemGenetic algorithmEvolutionary algorithmOptimization problemBasis (linear algebra)Polynomial-time approximation schemeGenetic programmingAlgorithmMathematicsArtificial intelligenceMachine learning
Affiliated Institutions
Related Publications
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Handbook of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...
Compressed sensing
Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible ...
Publication Info
- Year
- 1994
- Type
- book-chapter
- Pages
- 134-143
- Citations
- 65
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
65
OpenAlex
Cite This
Zbigniew Michalewicz,
Jarosław Arabas
(1994).
Genetic algorithms for the 0/1 knapsack problem.
Lecture notes in computer science
, 134-143.
https://doi.org/10.1007/3-540-58495-1_14
Identifiers
- DOI
- 10.1007/3-540-58495-1_14