Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications)

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications)

by PanosM.Pardalos (Editor)

Synopsis

On the other hand, computational complexity, originating from the interactions between computer science and numeri- cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.

$365.65

Quantity

20+ in stock

More Information

Format: Illustrated
Pages: 604
Edition: 2000
Publisher: Springer
Published: 31 May 2000

ISBN 10: 0792362756
ISBN 13: 9780792362753