• Contact

  • Newsletter

  • About us

  • Delivery options

  • News

  • 0
    Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday

    Optimization Problems in Graph Theory by Goldengorin, Boris;

    In Honor of Gregory Z. Gutin's 60th Birthday

    Series: Springer Optimization and Its Applications; 139;

      • GET 8% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice EUR 128.39
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        54 463 Ft (51 869 Ft + 5% VAT)
      • Discount 8% (cc. 4 357 Ft off)
      • Discounted price 50 105 Ft (47 719 Ft + 5% VAT)

    54 463 Ft

    db

    Availability

    Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
    Not in stock at Prospero.

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number Softcover reprint of the original 1st ed. 2018
    • Publisher Springer
    • Date of Publication 13 December 2018
    • Number of Volumes 1 pieces, Previously published in hardcover

    • ISBN 9783030069216
    • Binding Paperback
    • No. of pages331 pages
    • Size 235x155 mm
    • Weight 539 g
    • Language English
    • Illustrations 65 Illustrations, black & white; 22 Illustrations, color
    • 0

    Categories

    Short description:

    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

    More

    Long description:

    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

    More

    Table of Contents:

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

    More
    Recently viewed
    previous
    Design of a Controller for Load Frequency Control

    Design of a Controller for Load Frequency Control

    Gupta, Neelesh Kumar; Singh, Arun Kumar;

    16 925 HUF

    Cambridge IGCSE and O Level Additional Mathematics

    Cambridge IGCSE and O Level Additional Mathematics

    Hanrahan, Val; Powell, Jeanette;

    16 195 HUF

    Edexcel A Level Mathematics Year 1 (AS)

    Edexcel A Level Mathematics Year 1 (AS)

    Goldie, Sophie; Whitehouse, Susan; Hanrahan, Val;

    17 713 HUF

    next