Combinatorial Optimization. Questo articolo non è disponibile.
8 valutazioni di Goodreads
Lingua: inglese
Editore: Wiley-Interscience, 1997
- Prima edizione
- Rilegato
- Usato
Da: Textbooks_Source, Columbia, MO, U.S.A.Textbooks_Source
Venditore con 5 stelle
Venditore AbeBooks dal 10 novembre 2017
Non disponibile
Rilegato
Condizione: Usato - Buono
EUR 98,89
Descrizione dell’articolo da parte del venditore
Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
Codice articolo 000355603U
- Titolo
- Combinatorial Optimization
- Autore
- William J. Cook
- Editore
- Wiley-Interscience
- Anno di pubblicazione
- 1997
- Condizione
- Good
- Rilegatura
- hardcover
- Lingua
- inglese
- ISBN 10
- 047155894X
- ISBN 13
- 9780471558941
- Edizione
- 1st Edition.
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.
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.
"Riassunto" può appartenere a un’altra edizione 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.
"Descrizione articolo" può appartenere a un’altra edizione di questo titolo.