Approximation and Complexity in Numerical Optimization: Continuous and Discrete
218,74 €
There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems, from both a theoretical and a practical perspective. Such techniques include global optimization formulations, semidefinite programming, and spectral theory.
Jetzt bei Ebay:
