Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Iterative Methods in Combinatorial Optimization
Angličtina
154 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
8.60
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Pevná
118.77
€
/
Pevná
51.94
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?