Tracked shipping to South Africa with premium packaging for just R199 

Ship to
South Africa
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada approximation and complexity in numerical optimization: continuous and discrete problems
Type
Physical Book
Illustrated by
Publisher
Author
Year
2010
Language
English
Pages
581
Format
Paperback
Dimensions
23.4 x 15.6 x 3.1 cm
Weight
0.83 kg.
ISBN
1441948295
ISBN13
9781441948298
Categories

approximation and complexity in numerical optimization: continuous and discrete problems

Panos M. Pardalos (Illustrated by) · Springer · Paperback

approximation and complexity in numerical optimization: continuous and discrete problems - Pardalos, Panos M.

Cheaper New Book Imported to South Africa
Delivery: 22 Jul - 19 Aug Shipping: 13 to 17 business days.
R 3,247
Faster New Book Imported to South Africa
Delivery: 10 Jul - 04 Aug Shipping: 5 to 6 business days.
R 4,534
R 3,247

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "approximation and complexity in numerical optimization: continuous and discrete problems"

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet- ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap- proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob- lems, new approximate algorithms have been developed based on semidefinite pro- gramming and new randomization techniques. 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. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con- tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews