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
Solving large knapsack problems with a genetic algorithm
This paper develops a new approach to finding solutions to the subset sum problem. The subset sum problem is an important NP-complete problem in computer science which has appli...
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper pr...
On Finding Primal- and Dual-Optimal Bases
We show that if there exists a strongly polynomial time algorithm that finds a basis which is optimal for both the primal and the dual problems, given an optimal solution for on...
An interactive fuzzy satisficing method for multiobjective multidimensional 0-1 knapsack problems through genetic algorithms
In this paper, an interactive fuzzy satisficing method for multiobjective multidimensional 0-1 knapsack problems is proposed by incorporating the desirable features of both the ...
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Evolutionary algorithms (EAs) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to mul...
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