scientific article; zbMATH DE number 907942
From MaRDI portal
Publication:4886785
Recommendations
Cited in
(13)- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
- Tabu search for graph partitioning
- A genetic algorithm for graph partitioning
- A genetic/tabu thresholding hybrid algorithm for the process allocation problem
- Metaheuristics for the minimum gap graph partitioning problem
- Genetic local search for the graph partitioning problem under cardinality constraints
- Simple tabu search algorithm for the number partitioning problem
- scientific article; zbMATH DE number 5117494 (Why is no real title available?)
- Genetic algorithm and graph partitioning
- scientific article; zbMATH DE number 2034558 (Why is no real title available?)
- Solving the multidimensional maximum bisection problem by a genetic algorithm and variable neighborhood search
- scientific article; zbMATH DE number 956867 (Why is no real title available?)
- Performance of a genetic algorithm for the graph partitioning problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886785)