Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Link opens in a new tab
Search content at University of Birmingham
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Theory driven design of efficient genetic algorithms for a classical graph problem
Dogan Corus
*
,
Per Kristian Lehre
*
Corresponding author for this work
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Theory driven design of efficient genetic algorithms for a classical graph problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Level-based Analysis
100%
Theory-driven Design
100%
Fast Genetic Algorithm
100%
Graph Problems
100%
Analytical Tools
50%
Genetic Algorithm
50%
Population-based
50%
Theory-driven
50%
Evolutionary Algorithms
50%
Parameter Setting
50%
Algorithm Design
50%
Elitist
50%
Runtime Analysis
50%
Timing Optimization
50%
Design Guide
50%
Shortest Path Problem
50%
All-pairs Shortest Paths
50%
Computer Science
Classical Graph
100%
Genetic Algorithm
100%
Shortest Path Problem
50%
Analytical Tool
50%
Pair Shortest Path Problem
50%
Evolutionary Algorithm
50%
Mathematics
Genetic Algorithm
100%
Path Problem
100%
Upper Bound
50%
Evolutionary Algorithms
50%
Biochemistry, Genetics and Molecular Biology
Genetic Algorithm
100%
Evolutionary Algorithms
50%