Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Complexity In Numerical Optimization

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

PARDALOS P M

Língua

Inglês

Livro Livro de capa dura

Código Libristo: 05064447

Editoras World Scientific Publishing Co Pte Ltd, janeiro 1993

Computational complexity, originated from the interactions between computer science and numerical op... Descrição completa

Código Libristo: 05064447

588 b

241.77 €

50% de hipóteses Procuremos no mundo Quando vou receber o meu livro?

Até 30 dias para devoluções

Os clientes também compraram

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

Capa mole

20.21 €

Vienna Jackie Staddon

Capa mole

15.08 €

Ta z katovny Diana Štelová

Livro de capa dura

13.06 €

Natur Und Ursachen Des Volkswohlstandes Adam (Macquarie University) Smith

Capa mole

56.21 €

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

DVD

20.72 €

ZIM ZAM SCHURMANN

Livro de capa dura

14.57 €

Initial D T16 Shuichi Sugeno

Capa mole

9.04 €

La Grande Terreur Robert Conquest

Capa mole

34.39 €

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

DVD

13.67 €

JAZZY CHRISTMAS FOR ALTO SAXOPHONE Hal Leonard

Capa mole

38.91 €

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

Capa mole

26.05 €

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

Capa mole

15.68 €

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.