Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Iterative Methods in Combinatorial Optimization
Engleski
162 b
Do 30 dana za povrat
Kupci su kupili i
/
Meki uvez
48.84
€
/
Meki uvez
16.14
€
/
Meki uvez
42.88
€
/
Meki uvez
31.88
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Tvrdi uvez
124.13
€
/
Meki uvez
12.71
€
/
Tvrdi uvez
51.77
€
/
Tvrdi uvez
182.16
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?