Description: A First Course in Combinatorial Optimization by Jon Lee Jon Lee focuses on key mathematical ideas leading to useful models and algorithms, rather than on data structures and implementation details, in this introductory graduate-level text for students of operations research, mathematics, and computer science. The viewpoint is polyhedral, and Lee also uses matroids as a unifying idea. Topics include linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Problems and exercises are included throughout as well as references for further study. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description A First Course in Combinatorial Optimization is a 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. Table of Contents Introduction; Polytopes and linear programming; 1. Matroids and the greedy algorithm; 2. Minimum-weight dipaths; 3. Matroid intersection; 4. Matching; 5. Flows and cuts; 6. Cutting planes; 7. Branch- 8. Optimizing submodular functions; Appendix. Review The author, with his light but rigorous mathematical writing style, takes delight in revealing the stars of combinatorial optimization. This is an excellent teaching book; I recommend it highly. International Statistical Institute "Lee strikes a perfect balance between the specific and the general, between the concrete and the abstract." CHOICE "The author, with his light but rigorous mathematical writing style, takes delight in revealing the stars of combinatorial optimization. This is an excellent teaching book; I recommend it highly." International Statistical Institute "The book is attractively laid out on the page and there are lots of good diagrams. Algorithms are separated visually in special boxes and are easy to track down. There are plenty of problems (short proofs) and exercises (calculations) and they are well integrated with the text." MAA Reviews, Bill Satzer "Jon Lees A First Course in Combinatorial Optimization is a brilliant introduction to the topic." - Ryan B. Hayward, University of Alberta Review Quote "The book is attractively laid out on the page and there are lots of good diagrams. Algorithms are separated visually in special boxes and are easy to track down. There are plenty of problems (short proofs) and exercises (calculations) and they are well integrated with the text." MAA Reviews, Bill Satzer Promotional "Headline" This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Description for Bookstore This text is for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms. Description for Library This text is for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms. Details ISBN0521010128 Author Jon Lee Short Title 1ST COURSE IN COMBINATORIAL OP Pages 228 Publisher Cambridge University Press Series Cambridge Texts in Applied Mathematics Language English ISBN-10 0521010128 ISBN-13 9780521010122 Media Book Format Paperback DEWEY 519.64 Series Number 36 Illustrations Yes Year 2004 Publication Date 2004-02-28 Imprint Cambridge University Press Place of Publication Cambridge Country of Publication United Kingdom Birth 1960 Affiliation IBM T J Watson Research Center, New York DOI 10.1604/9780521010122 Audience Professional and Scholarly UK Release Date 2004-02-09 AU Release Date 2004-02-09 NZ Release Date 2004-02-09 We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:7685170;
Price: 134.78 AUD
Location: Melbourne
End Time: 2024-11-23T02:16:43.000Z
Shipping Cost: 0 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9780521010122
Book Title: A First Course in Combinatorial Optimization
Number of Pages: 228 Pages
Language: English
Publication Name: A First Course in Combinatorial Optimization
Publisher: Cambridge University Press
Publication Year: 2004
Subject: Mathematics
Item Height: 229 mm
Item Weight: 312 g
Type: Textbook
Author: Jon Lee
Item Width: 152 mm
Format: Paperback