Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
From MaRDI portal
Publication:2672647
Recommendations
- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Evolutionary algorithms in dynamic environments
- Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
- A multiagent-based evolutionary algorithm for dynamic knapsack problem
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Cites work
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Evolutionary learning: advances in theories and algorithms
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- Introduction to evolutionary computing
- Minimum spanning trees made easier via multi-objective optimization
- Nonparametric statistics for non-statisticians: a step-by-step approach
- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Cited in
(5)- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem
- scientific article; zbMATH DE number 1703851 (Why is no real title available?)
- Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem
- Analysis of the (1+1) EA on LeadingOnes with constraints
This page was built for publication: Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672647)
