Compartir
Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday (en Inglés)
Goldengorin, Boris (Autor)
·
Springer
· Tapa Dura
Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday (en Inglés) - Goldengorin, Boris
$ 232.46
$ 322.85
Ahorras: $ 90.39
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Viernes 19 de Julio y el
Viernes 26 de Julio.
Lo recibirás en cualquier lugar de Internacional entre 1 y 3 días hábiles luego del envío.
Reseña del libro "Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday (en Inglés)"
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
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Dura.
✓ Producto agregado correctamente al carro, Ir a Pagar.