Optimization problems graph theory (34 Ergebnisse)

23.5 cm x 15.5 cm. XVIII, 331 p. Hardcover. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Springer Optimization and Its Applications, 139. Sprache: Englisch.

Zustand: New.

Soft cover. Zustand: Good. 1st Edition.

Taschenbuch. Zustand: Neu. Genetic Algorithms And The Optimization Problems In Graph Theory | Milena Bogdanovic | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659353291 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Optimization Problems in Graph Theory | In Honor of Gregory Z. Gutin's 60th Birthday | Boris Goldengorin | Taschenbuch | Springer Optimization and Its Applications | xviii | Englisch | 2018 | Springer | EAN 9783030069216 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization.Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.…

Zustand: New. pp. 349.

Zustand: New.

paperback. Zustand: As New.

Hardcover. Zustand: Brand New. 352 pages. 9.25x6.10x1.02 inches. In Stock.

Hardcover. Zustand: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Zustand: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Softcover. Zustand: gut. Auflage: 2. Ziel des Buches ist es, Grundlagen der Linearen Optimierung einzuführen und einige der klassischen polynomial lösbaren Probleme der Netzwerkoptimierung vorzustellen. Das Buch ist als Basis für zwei Lehrveranstaltungen, die im Modul "Optimierung" im Bachelor-Studium angeboten werden, geeignet. Das Besondere dieses Lehrbuches ist die Tatsache, dass die Textteile parallel auf Deutsch und Englisch formuliert wurden, so dass neben der Vermittlung des Grundwissens in mathematischer Optimierung auch eine Einführung ins Fachenglisch bzw. in die deutsche Sprache stattfindet. Über den Autor: Prof. Dr. Horst W. Hamacher ist Professor für Wirtschaftsmathematik an der Universität Kaiserslautern. Prof. Dr. Kathrin Klamroth lehrt am Fachbereich Mathematik der Universität Erlangen-Nürnberg. Inhaltsverzeichnis von "Lineare Optimierung und Netzwerkoptimierung": Introduction and Applications - The Simplex Method - Duality and Further Variations of the Simplex Method - Interior Point Methods: Karmarkar's Projective Algorithm - Introduction to Graph Theory and Shortest Spanning Trees - Shortest Path Problems - Network Flow Problems - Matchings Mathematik Informatik Duality graph theory Interior point methods Karmarkar's Projective Algorithm Lineare Optimierung Matchings Network Flow Problems Netzwerke Optimization shortest path problems Shortest Spanning Trees Simplex method Netzwerkoptimierung Mathematik Informatik Duality graph theory Interior point methods Karmarkar's Projective Algorithm Lineare Optimierung Matchings Network Flow Problems Netzwerke Optimization shortest path problems Shortest Spanning Trees Simplex method In deutscher Sprache. 240 pages. 23,8 x 17,2 x 1,6 cm.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical optimization problem in computer science and is a typical example of an NP-hard optimization problem that has an approximation algorithm. Its decision version, the vertex cover problem was one of Karp's 21 NP-complete problems and is therefore a classical NP-complete problem in computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized complexity theory. The minimum vertex cover problem can be formulated as a half-integral linear program whose dual linear program is the maximum matching problem.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Zustand: new. Questo è un articolo print on demand.

Zustand: new. Questo è un articolo print on demand.

Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization.Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instances 352 pp. Englisch.…

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization.Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instances 352 pp. Englisch.…

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents open optimization problems in graph theory and networksFeatures advanced methods and techniques in combinatorial optimization and directed graphsHighlights applications to design efficient algorithmsThis book pres.…

Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents open optimization problems in graph theory and networksFeatures advanced methods and techniques in combinatorial optimization and directed graphsHighlights applications to design efficient algorithmsThis book pres.…

Buch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization.Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization.Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems.Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instancesSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 352 pp. Englisch.…

Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization.Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems.Topics covered in this work include: Algorithmic aspects of problems with disjoint cycles in graphs Graphs where maximal cliques and stable sets intersect The maximum independent set problem with special classes A general technique for heuristic algorithms for optimization problems The network design problem with cut constraints Algorithms for computing the frustration index of a signed graph A heuristic approach for studying the patrol problem on a graph Minimum possible sum and product of the proper connection number Structural and algorithmic results on branchings in digraphs Improved upper bounds for Korkel--Ghosh benchmark SPLP instancesSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 352 pp. Englisch.…