Hardcover. A First Course in Combinatorial Optimization is a 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. Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

N� de ref. del art�culo 9780521811514

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: A First Course in Combinatorial Optimization (Hardcover)
Editor: Cambridge University Press, Cambridge
Fecha de publicaci�n: 2004
Idioma: Ingl�s
ISBN 10: 0521811511
ISBN 13: 9780521811514
Encuadernaci�n: Hardcover
Estado: new

Acerca de

Sinopsis

This 2004 text is for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms.

Acerca del autor

Charlotte y Peter Fiell son dos autoridades en historia, teor�a y cr�tica del dise�o y han escrito m�s de sesenta libros sobre la materia, muchos de los cuales se han convertido en �xitos de ventas. Tambi�n han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Dise�o del siglo XX, El dise�o industrial de la A a la Z, Scandinavian Design y Dise�o del siglo XXI.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

The Nile Group Pty Ltd
42 Apex Drive, Truganina, VIC, 3029, Australia

Condiciones de venta y env�o

Condiciones de venta

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Condiciones de env�o

Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.