Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

Libros en inglés > Matemáticas y ciencias > Matemáticas > Cálculo y análisis matemático > Análisis numérico > Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Name: Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Brand: Springer-Verlag New York Inc.
SKU: 01423236
Price: 247.79 EUR
Availability: InStock
Author: Hanif D. Sherali
ISBN: 9781441948083

Hanif D. Sherali

W. P. Adams

Idioma

Inglés

Libro Tapa blanda

Código Libristo: 01423236

Editores Springer-Verlag New York Inc., diciembre 2010

This book addresses a new method for generating tight linear or convex programming relaxations for d... Descripción completa

Código Libristo: 01423236

606 b

247.79 €

Almacenamiento externo Envío en 5-8 días

Hasta 30 días para devoluciones

Clientes que también han comprado

Le guide de la Gentlewoman Vanessa Seward

Tapa blanda

27.79 €

Zakładka Academia Świat 15208 IF

binding.

4.79 €

Astrein war es nur selten Marcus Clary und Aldringen

Tapa blanda

22.09 €

Histoire Ancienne Jusqu'a Cesar Tome 2 Y. Otaka

Tapa blanda

46.39 €

Heilbehandlungen fur Dich und Dein geliebtes Tier Antonia Katharina Tessnow

Tapa blanda

19.89 €

ERRESKATATZAILE MAGIKOAK 2. ETA ALDERANTZIZKO URTEBETETZEA CATDOOR

Tapa blanda

13.89 €

Histoire De France Depuis 1799 Jusqu'en 1812, Volume 1 Louis-Pierre-Edouard Bignon

Tapa blanda

28.79 €

POSTERS Ricardo Liniers

Tapa blanda

25.59 €

Hygiene de la Ville de Lyon, Ou Opinions Et Rapports de l'Ancien Conseil de Salubrite Du Rhone ""

Tapa blanda

18.09 €

Le Tresor de la Cuisiniere Et de la Maitresse de Maison. (Ed.1852) Sans Auteur

Tapa blanda

20.99 €

Extramundana Carl Spitteler

Tapa blanda

34.49 €

Compendium Der Metallurgischen Chemie Carl A. M. Balling

Tapa blanda

39.39 €

Hotel im Lustgarten von Potsdam Jörg Fröhlich

Tapa blanda

8.49 €

Reader Gruppendynamik Anita Zimmermann

Tapa blanda

9.89 €

Rezeptionserweiterungen klassischer TV-Formate im Internet Erik Hilse

Tapa blanda

18.89 €

Das Vaterunser Neil Douglas-Klotz

Tapa blanda

14.99 €

Was Jones erzählt Catherine Rey

Tapa dura

21.99 €

QuarkXPress 6 pro Windows a Macintosh Elaine Weinmann

Tapa blanda

13.39 €

This book addresses a new method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems. Problems of this type arise in many economics, location-allocation, scheduling and routing, and process control and engineering design applications. The principal thrust is to commence with a model that affords a useful representation and structure, and then to further strengthen this representation through an automatic reformulation and constraint generation technique. The contents of this book comprise the original work of the authors compiled from several journal publications, and not covered in any other book on this subject. The outstanding feature of this book is that it offers for the first time a unified treatment of discrete and continuous nonconvex programming problems. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. The book lays the foundation of an idea that is stimulating and that has served to enhance the solubility of many challenging problems in the field. Audience: This book is intended for researchers and practitioners who work in the area of discrete or continuous nonlinear, nonconvex optimization problems, as well as for students who are interested in learning about techniques for solving such problems.