Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Complexity In Numerical Optimization

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

PARDALOS P M

Lingua

Inglese

Libro Rigido

Codice Libristo: 05064447

Casa editrice World Scientific Publishing Co Pte Ltd, gennaio 1993

Computational complexity, originated from the interactions between computer science and numerical op... Descrizione completa

Codice Libristo: 05064447

588 b

240.39 €

50% di possibilità Cercheremo nel mondo Quando riceverò il libro?

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Des Societes en commandite par actions, commentaire de la loi du 17 juillet 1856 Auguste Vavasseur

In brossura

20.09 €

Vienna Jackie Staddon

In brossura

14.99 €

Ta z katovny Diana Štelová

Rigido

13.49 €

Natur Und Ursachen Des Volkswohlstandes Adam (Macquarie University) Smith

In brossura

55.89 €

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

DVD

19.60 €

ZIM ZAM SCHURMANN

Rigido

14.49 €

Initial D T16 Shuichi Sugeno

In brossura

8.99 €

La Grande Terreur Robert Conquest

In brossura

34.19 €

Sammys Abenteuer - Die Suche nach der geheimen Passage, 1 DVD Domonic Paris

DVD

13.59 €

JAZZY CHRISTMAS FOR ALTO SAXOPHONE Hal Leonard

In brossura

38.69 €

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

In brossura

24.80 €

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

In brossura

15.59 €

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.