ENGLISH

A first course in combinatorial optimization

By Jon Lee

Book information

Publisher
Cambridge University Press
Year
2004
ISBN
0521010128, 978-0-521-01012-2, 0521811511
Open Library ID
OL22579396M
Language
english
Format
DJVU
Filesize
2 MB (1799401 bytes)
Series
Cambridge texts in applied mathematics
Pages
222\222
Library
Kolxo3
DPI
600
Time added
2009-07-20 03:45:11

Description

For advanced undergraduate or graduate level students with some elementary notions from graph theory, this text is intended as a rigorous, enticing introduction to be used in a one-semester course. Without attempting comprehensiveness and touching only lightly on applications, Lee (IBM T.J. Watson Research Center) discusses linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. He emphasizes the unifying roles of matroids, submodularity, and polyhedral combinatorics, and does not dwell on data structures and implementation details. Problems and exercises are included throughout.

Similar books