Tell your friends about this item:
Complexity In Numerical Optimization
Complexity In Numerical Optimization
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 and interior point algorithms.
400 pages
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | July 1, 1993 |
| ISBN13 | 9789810214159 |
| Publishers | World Scientific Publishing Co Pte Ltd |
| Pages | 528 |
| Dimensions | 150 × 220 × 20 mm · 861 g |
| Editor | Pardalos, Panos M. |
Christmas presents can be returned until 31 January