A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
From MaRDI portal
Recommendations
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- A two-phase method for multidimensional number partitioning problem
- A novel differential evolution algorithm for binary optimization
- Dichotomous binary differential evolution for knapsack problems
- Novel binary differential evolution algorithm for knapsack problems
- A binary differential evolution algorithm based on a parameterless mutation strategy
Cites work
- scientific article; zbMATH DE number 5504153 (Why is no real title available?)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Integer linear programming model for multidimensional two-way number partitioning problem
- MOEA/DEP: an algebraic decomposition-based evolutionary algorithm for the multiobjective permutation flowshop scheduling problem
- Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
Cited in
(3)
This page was built for publication: A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084514)