Mohlo by se vám také líbit

Informovat o naskladnění knihy

Více informací o knize Complexity In Numerical Optimization

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 617 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Calculus & mathematical analysis

• Plný název: Complexity In Numerical Optimization
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 528
• EAN: 9789810214159
• ISBN: 9810214154
• ID: 05064447
• Nakladatelství: World Scientific Publishing Co Pte Ltd
• Hmotnost: 862 g
• Rozměry: 216 × 163 × 33 mm
• Datum vydání: 07. January 1993

Oblíbené z jiného soudku

---

---

---