Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

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

by Boris Goldengorin
Save 35% Save 35%
Current price ₹8,814.00
Original price ₹13,559.00
Original price ₹13,559.00
Original price ₹13,559.00
(-35%)
₹8,814.00
Current price ₹8,814.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9783319948294
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 331
  • Original Price: EUR 119.99
  • Language: English
  • Edition: 2018
  • Item Weight: 667 grams
  • BISAC Subject(s): Applied, Production & Operations Management, and Combinatorics

From the Back Cover

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

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us