Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here.
"Sinopsis" puede pertenecer a otra edición de este libro.
Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here.
Dr. Sk. Md. Abu Nayeem has obtained his Ph.D. degree in Applied Mathematics from Vidyasagar University, Midnapore - 721 102, India in 2007. He is currently working as an Assistant Professor in the Department of Mathematics at Aliah University, Kolkata, India. His research interest includes Graph Theory, Algorithms, Fuzzy Sets etc.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here. 200 pp. Englisch. Nº de ref. del artículo: 9783848497249
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Nayeem Sk. Md. AbuDr. Sk. Md. Abu Nayeem has obtained his Ph.D. degree in Applied Mathematics from Vidyasagar University, Midnapore - 721 102, India in 2007. He is currently working as an Assistant Professor in the Department of Math. Nº de ref. del artículo: 5527146
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 200 pp. Englisch. Nº de ref. del artículo: 9783848497249
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here. Nº de ref. del artículo: 9783848497249
Cantidad disponible: 1 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA79638484972476
Cantidad disponible: 1 disponibles