FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Optimization Problems in Graph Theory

Optimization Problems in Graph Theory

Boris Goldengorin
    Product form
      FORMAT: Hardback

      R 4,330.18 Price and availability exclusive to website

      YOU COULD EARN 4,330.18 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 721.69 per month!
      3x monthly payments of R 1,443.39 with
      4x fortnightly payments of R 1,082.54 with
      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
      Format: Hardback CONTRIBUTORS: Boris Goldengorin EAN: 9783319948294 COUNTRY: Switzerland PAGES: WEIGHT: 694 g HEIGHT: 235 cm
      PUBLISHED BY: Springer International Publishing AG DATE PUBLISHED: 2018-10-11 CITY: GENRE: BUSINESS & ECONOMICS / Production & Operations Management, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Graphic Methods, MATHEMATICS / Combinatorics WIDTH: 155 cm SPINE:

      Book Themes:

      Distribution and logistics management, Numerical analysis, Optimization, Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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
      Format: Hardback CONTRIBUTORS: Boris Goldengorin EAN: 9783319948294 COUNTRY: Switzerland PAGES: WEIGHT: 694 g HEIGHT: 235 cm
      PUBLISHED BY: Springer International Publishing AG DATE PUBLISHED: 2018-10-11 CITY: GENRE: BUSINESS & ECONOMICS / Production & Operations Management, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Graphic Methods, MATHEMATICS / Combinatorics WIDTH: 155 cm SPINE:

      Book Themes:

      Distribution and logistics management, Numerical analysis, Optimization, Combinatorics and graph theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account