Combinatorial Optimization: 33 (Wiley Series in Discrete Mathematics and Optimization) - Tapa dura

Cook

 
9780471558941: Combinatorial Optimization: 33 (Wiley Series in Discrete Mathematics and Optimization)
Tapa dura
ISBN 10: 047155894X ISBN 13: 9780471558941
Editorial: Wiley-Interscience, 1997

Sinopsis

A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics

One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade.

Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include:
* Network flow problems
* Optimal matching
* Integrality of polyhedra
* Matroids
* NP-completeness

Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

WILLIAM J. COOK is a professor in the Department of Computational and Applied Mathematics at Rice University. WILLIAM H. CUNNINGHAM is a professor in the Department of Combinatorics and Optimization at the University of Waterloo. WILLIAM R. PULLEYBLANK is Director of Mathematical Sciences at IBM Watson Research in Yorktown Heights, New York. ALEXANDER SCHRIJVER is a department head at the Centrum voor Wiskunde en Informatica, with a joint appointment as a professor at the University of Amsterdam.

De la contraportada

A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics

One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade.

Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include:
* Network flow problems
* Optimal matching
* Integrality of polyhedra
* Matroids
* NP-completeness

Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.

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

Editorial
Wiley-Interscience
Año de publicación
1997
Idioma
Inglés
ISBN 10 
047155894X
ISBN 13 
9780471558941
Encuadernación
Tapa dura
Número de páginas
367
Contacto del fabricante
no disponible
Persona responsable
no disponible

Otras ediciones populares con el mismo título

9780387443898: [(Combinatorial Optimization : Polyhedra and Efficiency)] [By (author) Alexander Schrijver] published on (March, 2003)

Edición Destacada

ISBN 10:  0387443894 ISBN 13:  9780387443898
Tapa dura