國立虎尾科技大學 |

Optimization Problems in Graph Theory = In Honor of Gregory Z. Gutin's 60th Birthday /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Optimization Problems in Graph Theory/ edited by Boris Goldengorin.
其他題名:	In Honor of Gregory Z. Gutin's 60th Birthday /
其他作者:	Goldengorin, Boris.
面頁冊數:	XVIII, 331 p. 87 illus., 22 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical optimization. -
電子資源:	https://doi.org/10.1007/978-3-319-94830-0
ISBN:	9783319948300

Optimization Problems in Graph Theory = In Honor of Gregory Z. Gutin's 60th Birthday /
Optimization Problems in Graph TheoryIn Honor of Gregory Z. Gutin's 60th Birthday /[electronic resource] :edited by Boris Goldengorin. - 1st ed. 2018. - XVIII, 331 p. 87 illus., 22 illus. in color.online resource. - Springer Optimization and Its Applications,1391931-6828 ;. - Springer Optimization and Its Applications,104.

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 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).

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.

ISBN: 9783319948300

Standard No.: 10.1007/978-3-319-94830-0doiSubjects--Topical Terms:

527675
Mathematical optimization.

LC Class. No.: QA402.5-402.6

Dewey Class. No.: 519.6

Optimization Problems in Graph Theory = In Honor of Gregory Z. Gutin's 60th Birthday /
LDR:04060nam a22004095i 4500 001 991038
003 DE-He213
005 20200704012600.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319948300 $9 978-3-319-94830-0
024 7 $a 10.1007/978-3-319-94830-0 $2 doi
035 $a 978-3-319-94830-0
050 4 $a QA402.5-402.6
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
245 1 0 $a Optimization Problems in Graph Theory $h [electronic resource] : $b In Honor of Gregory Z. Gutin's 60th Birthday / $c edited by Boris Goldengorin.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XVIII, 331 p. 87 illus., 22 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 139
505 0 $a 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 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).
520 $a 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.
650 0 $a Mathematical optimization. $3 527675
650 0 $a Business logistics. $3 562973
650 0 $a Combinatorics. $3 669353
650 0 $a Algorithms. $3 527865
650 0 $a Graph theory. $3 527884
650 1 4 $a Optimization. $3 669174
650 2 4 $a Logistics. $3 643936
650 2 4 $a Graph Theory. $3 786670
700 1 $a Goldengorin, Boris. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1073780
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319948294
776 0 8 $i Printed edition: $z 9783319948317
776 0 8 $i Printed edition: $z 9783030069216
830 0 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 104 $3 1255232
856 4 0 $u https://doi.org/10.1007/978-3-319-94830-0
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)