Millions of books in English, Spanish and other languages. Free UK delivery 

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday
Type
Physical Book
Publisher
Language
English
Pages
331
Format
Hardcover
Dimensions
23.4 x 15.6 x 2.1 cm
Weight
0.67 kg.
ISBN13
9783319948294

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

Goldengorin, Boris (Author) · Springer · Hardcover

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

Physical Book

£ 136.32

  • Condition: New
Origin: U.S.A. (Import costs included in the price)
It will be shipped from our warehouse between Thursday, June 13 and Monday, July 01.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.

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

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.

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