Genetic search algorithms and their randomized operators

DOI10.1016/0898-1221(93)90202-7zbMath0796.68100OpenAlexW2014773434MaRDI QIDQ2365957

T. Chockalingam, S. Arun-Kumar

Publication date: 29 June 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90202-7

zbMATH Keywords

genetic algorithmsstochastic search procedures

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• A randomized heuristics for the mapping problem: The genetic approach
• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• A Heuristic Algorithm for Small Separators in Arbitrary Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Genetic Algorithms and the Optimal Allocation of Trials

This page was built for publication: Genetic search algorithms and their randomized operators