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 1960- (Author)
Format: Electronic eBook
Language:English
Published: Cambridge Cambridge University Press 2004
Series:Cambridge texts in applied mathematics 36
Subjects:
Online Access:BSB01
FHN01
TUM01
Volltext
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
Item Description:Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Physical Description:1 online resource (xvi, 211 pages)
ISBN:9780511616655
DOI:10.1017/CBO9780511616655

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text