Description: Optimization Problems in Graph Theory by Boris Goldengorin This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutins 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 FORMAT Hardcover LANGUAGE English CONDITION Brand New Back Cover This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutins 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: Table of Contents Gregory Gutin and Graph Optimization Problems (Noga Alon).- On graphs whose maximal cliques and stable sets intersect (Diogo V. Andrade and Endre Boros and Vladimir Gurvich).- Computing the Line Index of Balance Using Integer Programming Optimisation (Samin Aref, Andrew J. Mason and Mark C. Wilson).- Branching in Digraphs with Many and Few leaves: Structural and Algorithmic Results (JØrgen Bang-Jensen and Gregory Gutin).- Dominance Certificates for Combinatorial Optimization Problems (Daniel Berend and Steven S. Skiena and Yochai Twitto).- Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances (Daniel Karapetyan and Boris Goldengorin).- An algorithmic answer to the Ore-type version of Diracs question on disjoint cycles (H.A. Kierstead, A.V. Kostochka, T. Molla, D. Yager).- Optimal Patrol on a Graph against Random and Strategic Attackers (Richard G. McGrath).- Network Design Problem with Cut Constraints (Firdovsi Sharifov and Hakan Kutucu).- Process Sequencing Problem in Distributed Manufacturing Process Planning (Dusan Sormaz and Arkopaul Sarkar).- Sharp Nordhaus-Gaddum-type lower bounds for proper connection numbers of graphs (Yuefang Sun). Feature Presents open optimization problems in graph theory and networks Features advanced methods and techniques in combinatorial optimization and directed graphs Highlights applications to design efficient algorithms Details ISBN3319948296 Publisher Springer International Publishing AG Series Springer Optimization and Its Applications Year 2018 Edition 1st ISBN-10 3319948296 ISBN-13 9783319948294 Format Hardcover Imprint Springer International Publishing AG Place of Publication Cham Country of Publication Switzerland Edited by Boris Goldengorin DEWEY 511.5 Subtitle In Honor of Gregory Z. Gutins 60th Birthday Pages 331 Publication Date 2018-10-11 Short Title Optimization Problems in Graph Theory Language English DOI 10.1007/978-3-319-94830-0 Series Number 139 UK Release Date 2018-10-11 Illustrations 22 Illustrations, color; 65 Illustrations, black and white; XVIII, 331 p. 87 illus., 22 illus. in color. Author Boris Goldengorin Edition Description 1st ed. 2018 Alternative 9783030069216 Audience Professional & Vocational We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:127851516;
Price: 255.09 AUD
Location: Melbourne
End Time: 2025-01-06T16:25:19.000Z
Shipping Cost: 12.65 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783319948294
Book Title: Optimization Problems in Graph Theory
Number of Pages: 331 Pages
Language: English
Publication Name: Optimization Problems in Graph Theory: in Honor of Gregory Z. Gutin's 60th Birthday
Publisher: Springer International Publishing Ag
Publication Year: 2018
Subject: Mathematics, Management
Item Height: 235 mm
Item Weight: 694 g
Type: Textbook
Author: Boris Goldengorin
Item Width: 155 mm
Format: Hardcover