Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € Kuriér GLS 3.99 € Zberné miesto GLS 2.49 € SPS 3.99 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Slovenská pošta 3.99 € Zberné miesto DPD 2.99 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Complexity In Numerical Optimization

Name: Complexity In Numerical Optimization
Brand: World Scientific Publishing Co Pte Ltd
SKU: 05064447
Price: 186.29 EUR
Availability: InStock
Author: PARDALOS P M
ISBN: 9789810214159

PARDALOS P M

Jazyk

Angličtina

Kniha Pevná

Libristo kód: 05064447

Nakladateľstvo World Scientific Publishing Co Pte Ltd, január 1993

Computational complexity, originated from the interactions between computer science and numerical op... Celý popis

Libristo kód: 05064447

452 b

186.29 €

50 % šanca Prehľadáme celý svet Kedy knihu dostanem?

Až 30 dní na vrátenie tovaru

Zákazníci tiež kúpili

Vienna Jackie Staddon

Brožovaná

16.23 €

Ta z katovny Diana Štelová

Pevná

10.38 €

Natur Und Ursachen Des Volkswohlstandes Adam (Macquarie University) Smith

Brožovaná

53.25 €

Bibi & Tina - Mädchen gegen Jungs, 1 DVD Detlev Buck

DVD

19.76 €

Initial D T16 Shuichi Sugeno

Brožovaná

10.78 €

La Grande Terreur Robert Conquest

Brožovaná

37.31 €

Everyday Mathematics, Grade K, My First Math Book/Mi Primer Libro de Matematicas Max Bell

Brožovaná

25.00 €

La metáfora milenaria : una lectura psicoanalítica de la Biblia Daniel Schoffer

Brožovaná

16.63 €

JAZZY CHRISTMAS FOR ALTO SAXOPHONE Hal Leonard

Brožovaná

18.04 €

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.