Kód: 05066987
Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science and computer science. In combinatorial optimization and graph theory, many approaches ha ... celý popis
Angličtina
147.10 €
Dostupnosť:
50 % šanca
Máme informáciu, že by titul mohol byť dostupný. Na základe vašej objednávky sa ho pokúsime do 6 týždňov zabezpečiť.
Zadajte do formulára e-mailovú adresu a akonáhle knihu naskladníme, zašleme vám o tom správu. Postrážime všetko za vás.
Nákupom získate 356 bodov
Anotácia knihy
Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.
Parametre knihy
Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Optimization
147.10 €
Angličtina
Osobný odber Bratislava a 12744 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )