9789810214159 - Complexity In Numerical Optimization (2 resultados)

Hardcover. Condición: Fine. Estado de la sobrecubierta: Very Good. Signed. Signed and inscribed by the editor on the half title page. Inscribed to Professor S. Smale, Math Dept. City University of Hong Kong. No other markings in book. DJ with shelf wear to edges. Binding is tight. Very lightly read. Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. This volume is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial.

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.