Artículos relacionados a Genetic Algorithms And The Optimization Problems In...

Genetic Algorithms And The Optimization Problems In Graph Theory - Tapa blanda

Bogdanović, Milena

 
9783659353291: Genetic Algorithms And The Optimization Problems In Graph Theory
Tapa blanda
ISBN 10: 3659353299 ISBN 13: 9783659353291
Editorial: LAP LAMBERT Academic Publishing, 2013

Sinopsis

Graph theory, as modern and young branches of mathematics, studies graphs which are abstract mathematical objects. The use of graph models for description or data structures is very common. Investigation of algorithms to solve problems using graph, is a very important part of computer science. The genetic algorithms represent a family of algorithms using some of genetic principles being present in nature, in order to solve particular computational problems. These natural principles are: inheritance, crossover, mutation, survival of the fittest, migrations and so on. The problems degree-limited graph of nodes considering the weight of the vertex or weight of the edges, with the aim to find the optimal weighted graph in terms of certain restrictions on the degree of the vertices in the subgraph. This class of combinatorial problems was extensively studied because of the implementation and application in network design, connection of networks and routing algorithms. It is likely that solution of MDBCS problem will find its place and application in these areas.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Graph theory, as modern and young branches of mathematics, studies graphs which are abstract mathematical objects. The use of graph models for description or data structures is very common. Investigation of algorithms to solve problems using graph, is a very important part of computer science. The genetic algorithms represent a family of algorithms using some of genetic principles being present in nature, in order to solve particular computational problems. These natural principles are: inheritance, crossover, mutation, survival of the fittest, migrations and so on. The problems degree-limited graph of nodes considering the weight of the vertex or weight of the edges, with the aim to find the optimal weighted graph in terms of certain restrictions on the degree of the vertices in the subgraph. This class of combinatorial problems was extensively studied because of the implementation and application in network design, connection of networks and routing algorithms. It is likely that solution of MDBCS problem will find its place and application in these areas.

Biografía del autor

Milena Bogdanović is the assistant professor at the Teacher Training Faculty in Vranje, University of Niš, Serbia (major in Mathematics and Informatics – Mathematics 1, Mathematics 2, Elementary mathematical concepts, IT in Education, Educational technology, Elements of mathematics).She is the Reviewer of several international journals.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
LAP LAMBERT Academic Publishing
Año de publicación
2013
Idioma
Inglés
ISBN 10 
3659353299
ISBN 13 
9783659353291
Encuadernación
Tapa blanda
Número de páginas
72
Contacto del fabricante
no disponible
Persona responsable
no disponible