Get Free Shipping on orders over $0
Complexity in Numerical Optimization - P M Pardalos

Complexity in Numerical Optimization

By: P M Pardalos (Editor)

Hardcover | 1 December 1992

At a Glance

Hardcover


RRP $352.99

$247.75

30%OFF

or 4 interest-free payments of $61.94 with

 or 

Ships in 15 to 25 business days

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 optimization, fixed point computations, and network flow problems. This volume should be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.

More in Applied Mathematics

Aircraft Engineering Principles - Lloyd Dingle

RRP $362.00

$361.75

Aircraft Engineering Principles - Lloyd Dingle

RRP $121.99

$121.75

Dynamics of Marine Structures - Yingguang  Wang

RRP $503.95

$442.99

12%
OFF
The Maths Book : Big Ideas Simply Explained - DK

RRP $45.00

$35.75

21%
OFF
Six Maths Essentials : How to Model the World - Terence Tao

RRP $49.99

$37.99

24%
OFF
Intermediate Financial Theory : 3rd Edition - Jean-Pierre Danthine

RRP $195.75

$190.99

Essentials of Medical Statistics : 2nd Edition - Betty R. Kirkwood

RRP $91.95

$59.99

35%
OFF
Introduction to Stochastic Processes : 2nd Edition - Gregory F. Lawler
Bird's Higher Engineering Mathematics : 9th Edition - John  Bird