» » Complexity in Numerical Optimization

Information of news
11-03-2015, 17:49

Complexity in Numerical Optimization

Category: E-Books

Complexity in Numerical Optimization

Panos M. Pardalos, "Complexity in Numerical Optimization"
English | ISBN: 9810214154 | 1993 | 400 pages | PDF | 63 MB

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.

Enjoy Download


Site BBcode/HTML Code:
Dear visitor, you went to the site as unregistered user.
We recommend you Sign up or Login to website under your name.
Would you like to leave your comment? Please Login to your account to leave comments. Don't have an account? You can create a free account now.