Mohlo by sa vám tiež páčiť

Viac informácií o knihe Iterative Methods in Combinatorial Optimization

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 271 bodov

Anotácia knihy

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Optimization

• Celý názov: Iterative Methods in Combinatorial Optimization
• Autor: Lap Chi LauR. RaviMohit Singh
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 254
• EAN: 9781107007512
• ISBN: 1107007518
• ID: 02050506
• Nakladateľ: Cambridge University Press
• Hmotnosť: 480 g
• Rozmery: 235 × 159 × 18 mm
• Dátum vydania: 18. April 2011

Obľúbené z iného súdka

---

---

---