LEADER 04867nam  22006255  450 
001 9910300128703321
005 20200704012600.0
010   $a3-319-94830-X
024 7 $a10.1007/978-3-319-94830-0
035   $a(CKB)4100000006674955
035   $a(MiAaPQ)EBC5528156
035   $a(DE-He213)978-3-319-94830-0
035   $a(PPN)230539629
035   $a(EXLCZ)994100000006674955
100   $a20180927d2018      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aOptimization Problems in Graph Theory $eIn Honor of Gregory Z. Gutin's 60th Birthday /$fedited by Boris Goldengorin
205   $a1st ed. 2018.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018.
215   $a1 online resource (341 pages)
225 1 $aSpringer Optimization and Its Applications,$x1931-6828 ;$v139
311   $a3-319-94829-6 
327   $aGregory 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 Dirac?s 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).
330   $aThis 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.
410  0$aSpringer Optimization and Its Applications,$x1931-6828 ;$v139
606   $aMathematical optimization
606   $aBusiness logistics
606   $aCombinatorics
606   $aAlgorithms
606   $aGraph theory
606   $aOptimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26008
606   $aLogistics$3https://scigraph.springernature.com/ontologies/product-market-codes/519020
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018
606   $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020
615  0$aMathematical optimization.
615  0$aBusiness logistics.
615  0$aCombinatorics.
615  0$aAlgorithms.
615  0$aGraph theory.
615 14$aOptimization.
615 24$aLogistics.
615 24$aCombinatorics.
615 24$aAlgorithms.
615 24$aGraph Theory.
676   $a511.5
702   $aGoldengorin$b Boris$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910300128703321
996   $aOptimization Problems in Graph Theory$91563708
997   $aUNINA