
Combinatorial Optimization
Wiley (Publisher)
Published on 11. December 1997
Book
Hardback
XII, 356 pages
978-0-471-55894-1 (ISBN)
Description
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.
More details
Series
Edition
1. Auflage
Language
English
Place of publication
United States
Publishing group
John Wiley & Sons Inc
Target group
College/higher education
Professional and scholarly
Product notice
sewn/stitched
Cloth over boards
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 24 mm
Weight
718 gr
ISBN-13
978-0-471-55894-1 (9780471558941)
Schweitzer Classification
Other editions
Additional editions

William J. Cook | William H. Cunningham | William R. Pulleyblank
Combinatorial Optimization
E-Book
09/2011
Wiley
€182.99
Available for download
Persons
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.
Content
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.