Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Complexity In Numerical Optimization
Angleščina
452 b
30 dni za vračilo blaga
Drugi so kupili tudi
/
Mehka
23.23
€
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.
O knjigi
Angleščina
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaMorda bi vas zanimalo tudi
/
Mehka
22.52
€
