Optimization Problems in Graph Theory In Honor of Gregory Z. Gutin's 60th Birthday / edited 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 Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in compu...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Goldengorin, Boris (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2018.
Edition:1st ed. 2018.
Series:Springer Optimization and Its Applications, 139
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3259980
003 MWH
005 20191220125828.0
007 cr nn 008mamaa
008 180927s2018 gw | s |||| 0|eng d
020 |a 9783319948300 
024 7 |a 10.1007/978-3-319-94830-0  |2 doi 
035 |a (DE-He213)978-3-319-94830-0 
050 4 |a E-Book 
072 7 |a PBU  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a PBU  |2 thema 
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 
490 1 |a Springer eBook Collection 
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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Mathematical optimization. 
650 0 |a Business logistics. 
650 0 |a Combinatorics. 
650 0 |a Algorithms. 
650 0 |a Graph theory. 
690 |a Electronic resources (E-books) 
700 1 |a Goldengorin, Boris.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Springer Optimization and Its Applications,  |x 1931-6828 ;  |v 139 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-319-94830-0  |3 Click to view e-book  |t 0 
907 |a .b32599808  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21731421  |z 02-26-20 
999 f f |i a49e2f09-feaf-5617-b031-b59545576665  |s 263fc6fe-ae43-55d5-8a8d-cfe11476be40  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File