A First Course in Combinatorial Optimization

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear...

Full description

Saved in:
Bibliographic Details
Main Author Lee, Jon
Format eBook Book
LanguageEnglish
Published Cambridge Cambridge University Press 2004
Edition1
SeriesCambridge Texts in Applied Mathematics
Subjects
Combinatorial analysis
Combinatorial optimization
Online AccessGet full text
ISBN0521010128
0521811511
9780521010122
9780521811514
DOI10.1017/CBO9780511616655

Cover

More Information
Summary:A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
Bibliography:Includes bibliographical references and index
ISBN:0521010128
0521811511
9780521010122
9780521811514
DOI:10.1017/CBO9780511616655