Combinatorial optimization

Combinatorial optimization

by A Schrijver

Book 24 of Algorithms and combinatorics --

2003
Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
An in-depth overview of polyhedral methods and efficient algorithms incombinatorial optimization. These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on thebasic subjects are presented.

Discuss Combinatorial optimization with other readers

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

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Combinatorial optimization?

Sign up free on Readfeed, then browse public clubs or start your own club with 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 Combinatorial optimization with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about 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.