國立高雄大學圖資館 |

Language: English

Back

Optimization problems in graph theor...

Goldengorin, Boris.

Optimization problems in graph theoryin honor of Gregory Z. Gutin's 60th birthday /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Optimization problems in graph theoryedited by Boris Goldengorin.
Reminder of title:	in honor of Gregory Z. Gutin's 60th birthday /
other author:	Goldengorin, Boris.
Published:	Cham :Springer International Publishing :2018.
Description:	xviii, 331 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Graph theory.
Online resource:	https://doi.org/10.1007/978-3-319-94830-0
ISBN:	9783319948300$q(electronic bk.)

Optimization problems in graph theoryin 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. - Cham :Springer International Publishing :2018. - xviii, 331 p. :ill., digital ;24 cm. - Springer optimization and its applications,v.1391931-6828 ;. - Springer optimization and its applications ;v. 3..

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 (Jorgen 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 Korkel-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)

ISBN: 9783319948300$q(electronic bk.)

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

181880
Graph theory.

LC Class. No.: QA166 / .O685 2018

Dewey Class. No.: 511.5

Optimization problems in graph theoryin honor of Gregory Z. Gutin's 60th birthday /
LDR:02311nmm a2200325 a 4500 001 544759
003 DE-He213
005 20190314155136.0
006 m d
007 cr nn 008maaau
008 190508s2018 gw s 0 eng d
020 $a 9783319948300$q(electronic bk.)
020 $a 9783319948294$q(paper)
024 7 $a 10.1007/978-3-319-94830-0 $2 doi
035 $a 978-3-319-94830-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166 $b .O685 2018
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .O62 2018
245 0 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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xviii, 331 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer optimization and its applications, $x 1931-6828 ; $v 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 (Jorgen 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 Korkel-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)
650 0 $a Graph theory. $3 181880
650 0 $a Mathematical optimization. $3 183292
650 1 4 $a Optimization. $3 274084
650 2 4 $a Logistics. $3 200159
650 2 4 $a Combinatorics. $3 274788
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Graph Theory. $3 522732
700 1 $a Goldengorin, Boris. $3 585198
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Springer optimization and its applications ; $v v. 3. $3 440366
856 4 0 $u https://doi.org/10.1007/978-3-319-94830-0
950 $a Mathematics and Statistics (Springer-11649)