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.

First Course in Combinatorial Optimization

Name: First Course in Combinatorial Optimization
Brand: Cambridge University Press
SKU: 02044531
Price: 114.39 EUR
Availability: InStock
Author: Jon Lee
ISBN: 9780521811514

Jon Lee

Idioma

Inglés

Libro Tapa dura

Código Libristo: 02044531

Editores Cambridge University Press, febrero 2004

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate... Descripción completa

Código Libristo: 02044531

280 b

114.39 €

Almacenamiento externo Envío en 9-15 días

Política de devolución de 30 días

Clientes que también han comprado

Turn Off The Bubble Machine Die Geschwister Pfister

CD de audio

20.29 €

Im Strom Unsrer Zeit - Erster Teil Max Eyth

Tapa blanda

17.79 €

Indischen Furstenhofen Otto E. Ehlers

Tapa blanda

34.49 €

Die Nähe des Himmels Nicholas Sparks

Tapa blanda

13.69 €

Chudnij z prawem rezonansu Franckh Pierre

Tapa blanda

10.49 €

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.