Amazon.com: Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications (closed)) (9780792362753): Panos M. Pardalos: Books
Approximation and Complexity in Numerical Optimization and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications  (closed))
 
 
Start reading Approximation and Complexity in Numerical Optimization on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications (closed)) [Hardcover]

Panos M. Pardalos (Editor)

Price: $264.00 & this item ships for FREE with Super Saver Shipping. Details
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Tuesday, February 28? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $211.20  
Hardcover $264.00  
Paperback $264.00  

Book Description

May 31, 2000 0792362756 978-0792362753 1
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 geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new approximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization problems, new approximate algorithms have been developed based on semidefinite programming and new randomization techniques. On the other hand, computational complexity, originating 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. 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. The two themes of approximation and complexity pervade this book. Audience: Faculty, graduate students, and researchers in mathematical programming, computer sciences and engineering.

Product Details


Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
unit size jobs, related speed machines, successive convex relaxation methods, periodic specifications, nonlinear arc costs, minimal tree problem, swapping point, auction algorithm, hypercube points, interval linear systems, closed pointed convex cone, center cutting plane method, min convex, cpu iter, vine models, redundant assignment, strict local maximizer, cost network flow problem, maximum clique problem, potential facility locations, replicator equations, hierarchical formations, machine subsets, uncapacitated facility location problem, subtree isomorphism
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Kluwer Academic Publishers, Numerical Optimization, Minimum Fault-Tolerant Maximum Load, Management Science, Theory of Computing, Next Fit, Los Alamos, Safe Partition, Discrete Mathematics, Generalized Knapsack, John Wiley, Journal of Global Optimization, Lecture Notes, Steiner's Problem, Bin Covering, Department of Mathematics, San Francisco, Speed Class Partition, Institute of Mathematics, Academic Press, Best Fit, Iowa City, List Scheduling, New Jersey, American Mathematical Society
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Search Inside This Book:

Citations (learn more)
This book cites 90 books:
See all 90 books this book cites
 
11 books cite this book:
See all 11 books citing this book



Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject