Articoli correlati a Combinatorial Optimization

Combinatorial Optimization - Rilegato

Cook

 
9780471558941: Combinatorial Optimization
Rilegato
ISBN 10: 047155894X ISBN 13: 9780471558941
Casa editrice: Wiley-Interscience, 1997

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull'autore

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.

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Wiley-Interscience
Data di pubblicazione
1997
Lingua
Inglese
ISBN 10 
047155894X
ISBN 13 
9780471558941
Rilegatura
Copertina rigida
Numero di pagine
367
Contatto del produttore
non disponibile
Persona responsabile
gpsr@libri.de
gpsr@libri.de

Europaallee 1
Bad Hersfeld
36244
Germania