
A First Course in Combinatorial Optimization
£43.99
Part of Cambridge Texts in Applied Mathematics
- Author: Jon Lee, University of Michigan, Ann Arbor
- Date Published: April 2004
- availability: Available
- format: Paperback
- isbn: 9780521010122
£
43.99
Paperback
-
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.
Read more- Self contained (includes all linear-programming preliminaries)
- Aimed as a one-semester textbook (not a research monograph)
- Problems and exercises interspersed in the exposition, making the text a 'workbook' for the student
Reviews & endorsements
'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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: April 2004
- format: Paperback
- isbn: 9780521010122
- length: 228 pages
- dimensions: 229 x 152 x 17 mm
- weight: 0.312kg
- availability: Available
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-&-bound
8. Optimizing submodular functions
Appendix.Instructors have used or reviewed this title for the following courses
- Integer Programming and Combinatorial Optimization
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×