000 -LEADER |
fixed length control field |
nam a22 7a 4500 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
190527b xxu||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783319948294 |
Terms of availability |
(hbk) |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
511.5 |
Item number |
GOL |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Goldengorin, Boris |
245 ## - TITLE STATEMENT |
Title |
Optimization problems in graph theory : in honor of Gregory Z. Gutin's 60th birthday |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
Switzerland : |
Name of publisher, distributor, etc |
Springer, |
Date of publication, distribution, etc |
2018 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xviii,331 p. : |
Other physical details |
ill. ; |
Dimensions |
24 cm. |
365 ## - TRADE PRICE |
Price type code |
EUR |
Price amount |
99.99 |
Unit of pricing |
00 |
490 ## - SERIES STATEMENT |
Series statement |
Springer optimization and its applications ; |
Volume number/sequential designation |
v. 139 |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliographical references. |
520 ## - SUMMARY, ETC. |
Summary, etc |
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. |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Graph theory |
|
Topical term or geographic name as entry element |
Mathematical optimization |
|
Topical term or geographic name as entry element |
Business & economics |
|
Topical term or geographic name as entry element |
Management of specific areas |
|
Topical term or geographic name as entry element |
Combinatorics |
|
Topical term or geographic name as entry element |
Numerical analysis |
|
Topical term or geographic name as entry element |
Algorithms |
|
Topical term or geographic name as entry element |
Logistics |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
Books |