ISBN: 9783030069216 - optimization problems in graph theory: in honor of gregory z. gutin's 60th birthday: 139 (9 risultati)

Taschenbuch. Condizione: 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.…

Condizione: New. pp. 349.

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

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

Taschenbuch. Condizione: 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.…

Condizione: 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.…

Taschenbuch. Condizione: 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.…

Condizione: New. Print on Demand pp. 349.

Condizione: New. PRINT ON DEMAND pp. 349.