A First Course in Combinatorial Optimization

A First Course in Combinatorial Optimization

by Jon Lee

211 pages· 2004· ISBN 9780521010122
About
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.

Discuss A First Course in Combinatorial Optimization with other readers

Join or start a book club for A First Course in Combinatorial Optimization on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for A First Course in Combinatorial Optimization?

Sign up free on Readfeed, then browse public clubs or start your own club with A First Course in Combinatorial Optimization as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss A First Course in Combinatorial Optimization with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about A First Course in Combinatorial Optimization with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.