Tracked shipping to South Africa with premium packaging for just R199 

Ship to
South Africa
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday
Type
Physical Book
Publisher
Author
Language
English
Pages
331
Format
Paperback
ISBN13
9783030069216
Categories

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

Goldengorin, Boris (Author) · Springer · Paperback

Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday - Goldengorin, Boris

Cheaper New Book Imported to South Africa
Delivery: 03 Aug - 01 Sep Shipping: 20 to 25 business days.
R 1,988
Faster New Book Imported to South Africa
Delivery: 22 Jul - 14 Aug Shipping: 12 to 13 business days.
R 2,547
R 1,988

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

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

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

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews