An interactive genetic algorithm applies to multiobjective knapsack problem
From MaRDI portal
Recommendations
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- An interactive heuristic method for multi-objective combinatorial optimization
- Interactive evolutionary multi-objective optimization for quasi-concave preference functions
- scientific article; zbMATH DE number 1488081
- An improved interactive hybrid method for the linear multi-objective knapsack problem
Cited in
(9)- An improved interactive hybrid method for the linear multi-objective knapsack problem
- An evolutionary metaheuristic for approximating preference-nondominated solutions
- scientific article; zbMATH DE number 2086191 (Why is no real title available?)
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- scientific article; zbMATH DE number 1114464 (Why is no real title available?)
- scientific article; zbMATH DE number 1437206 (Why is no real title available?)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
This page was built for publication: An interactive genetic algorithm applies to multiobjective knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4546415)
