Distributed Memetic Algorithms for Graph-Theoretical Combinatorial Optimization Problems by Thomas Fischer

Distributed Memetic Algorithms for Graph-Theoretical Combinatorial Optimization Problems

Thomas Fischer

327 pages missing pub info (editions)

nonfiction computer science science informative medium-paced
Powered by AI (Beta)
Loading...

Description

In this thesis, three different graph-theoretical combinatorial optimization problems have been addressed by memetic and distributed algorithms. These three problems include the well-known 'Travelling Salesman Problem' (TSP) and the two communicat...

Read more

Community Reviews

Loading...

Content Warnings

Loading...