Code: 05064447
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 t ... more
English
186.75 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 452 loyalty points
Book synopsis
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.
Book details
Book category Books in English Mathematics & science Mathematics Calculus & mathematical analysis
186.75 €
English
Collection points Bratislava a 12839 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25682 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )