Ship-Ship-Hooray! Free Shipping on $25+ Details >
Combinatorial Optimization

Combinatorial Optimization - 98 edition

Combinatorial Optimization - 98 edition

ISBN13: 9780471558941

ISBN10: 047155894X

Combinatorial Optimization by William J. Cook and William H. Cunningham - ISBN 9780471558941
Cover type: Hardback
Edition: 98
Copyright: 1998
Publisher: John Wiley & Sons, Inc.
Published: 1998
International: No
Combinatorial Optimization by William J. Cook and William H. Cunningham - ISBN 9780471558941

ISBN13: 9780471558941

ISBN10: 047155894X

Cover type: Hardback
Edition: 98

List price: $198.00

Happy you, happy us. You get 24-hour turnaround. Free shipping on $25+, and dedicated customer service. Cue the smiley faces.

Ships directly from us
You Save $79.20 (40%)
$118.80

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Summary

Combinatorial optimization is a lively field of applied mathematics, combining techniques from combinatorics, linear programming, and the theory of algorithms, to solve optimization problems over discrete structures. This new treatment of the subject covers some of the advances that have been made in the past decade. Subjects include the theory, algorithms, and applications of this relatively young area in a manner accessible to senior and graduate students in mathematics and more.

Author Bio

Cook, William J. : Rice University

William J. Cook is a professor in the Department of Computational and Applied Mathematics at Rice University.

Cunningham, William H. : University of Waterloo

William H. Cunningham is a professor in the Department of Combinatorics and Optimization at the University of Waterloo.

Pulleyblank, William R. :

William R. Pulleybank is Director of Mathematical Sciences at IBM Watson Research in Yorktown
Heights, New York.

Schrijver, Alexander : Universiteit van Amsterdam

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.

Table of Contents

Table of Contents

Problems and Algorithms.

Optimal Trees and Paths.

Maximum Flow Problems.

Minimum-Cost Flow Problems.

Optimal Matchings.

Integrality of Polyhedra.

The Traveling Salesman Problem.

Matroids.

NP and NP-Completeness.

Appendix.
Bibliography.
Index.

Top Arrow

Top