Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Complexity In Numerical Optimization

Name: Complexity In Numerical Optimization
Brand: World Scientific Publishing Co Pte Ltd
SKU: 05064447
Price: 202.59 EUR
Availability: InStock
Author: PARDALOS P M
ISBN: 9789810214159

PARDALOS P M

Language

English

Book Hardback

Libristo code: 05064447

Publishers World Scientific Publishing Co Pte Ltd, January 1993

Computational complexity, originated from the interactions between computer science and numerical op... Full description

Libristo code: 05064447

496 b

202.59 € VAT included

50 % chance We search the world When will I receive my book?

Delivery to Austria

30-day return policy

Customers also purchased

Natur Und Ursachen Des Volkswohlstandes Adam (Macquarie University) Smith

Paperback

59.90 €

La Grande Terreur Robert Conquest

Paperback

38.59 €

Initial D T16 Shuichi Sugeno

Paperback

11.09 €

Ta z katovny Diana Štelová

Hardback

13.89 €

Vienna Jackie Staddon

Paperback

16.89 €

Everyday Mathematics, Grade K, My First Math Book/Mi Primer Libro de Matematicas Max Bell

Paperback

25.29 €

La metáfora milenaria : una lectura psicoanalítica de la Biblia Daniel Schoffer

Paperback

17.19 €

JAZZY CHRISTMAS FOR ALTO SAXOPHONE Hal Leonard

Paperback

20.19 €

Bibi & Tina - Mädchen gegen Jungs, 1 DVD Detlev Buck

DVD

20.59 €

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.