Andere Kunden interessierten sich auch für
![Optimal Scheduling of Virtualised Workloads using Learning Algorithms]( "Optimal Scheduling of Virtualised Workloads using Learning Algorithms")
Optimal Scheduling of Virtualised Workloads using Learning Algorithms45,99 €![Python Programming]( "Python Programming")
Python Programming51,99 €![Optimal Erasure Protection Assignment for Scalable Data]( "Optimal Erasure Protection Assignment for Scalable Data")
Optimal Erasure Protection Assignment for Scalable Data44,99 €![CTA - An algorithm for time critical task assignment problems]( "CTA - An algorithm for time critical task assignment problems")
CTA - An algorithm for time critical task assignment problems30,99 €![Solving permutation-based combinatorial optimisation problems]( "Solving permutation-based combinatorial optimisation problems")
Solving permutation-based combinatorial optimisation problems50,99 €![Efficient Algorithms for the Maximum Convex Sum Problem]( "Efficient Algorithms for the Maximum Convex Sum Problem")
Efficient Algorithms for the Maximum Convex Sum Problem32,99 €![Clustering Gene Expression Data Using Modified Cuckoo Search Algorithm]( "Clustering Gene Expression Data Using Modified Cuckoo Search Algorithm")
Clustering Gene Expression Data Using Modified Cuckoo Search Algorithm23,99 €
In recent years, we have witnessed a tremendous growth of communication networks. This is because they are widely used in all walks of life, and this trend continues increasing. The research on computer communication networking field has also grown explosively due to a large variety of combinatorial optimisation problems. One of these problems is the Terminal Assignment Problem which implies fixing the minimum cost links to construct a network between a specified set of terminals and concentrators. A good solution for this problem should maintain small distances between concentrators and terminals assigned to them without exceeding the capacity of any concentrator. Additionally, it should also maintain a balanced distribution of terminals among concentrators. The intractability of this problem is a motivation for the pursuits of different approximation algorithms. In this book, we explore several metaheuristics applied to the Terminal Assignment Problem and other similar problems. Simulation results verify the effectiveness of these algorithms.