Trending Courses

Topics In Combinatorial Optimization


In this graduate-level course, we shall be overlaying superior subjects in combinatorial optimization. We’ll begin with non-bipartite matchings and canopy many outcomes extending the basic outcomes of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial outcomes, together with min-max relations, and never a lot on the corresponding algorithmic questions of the right way to discover such objects. The supposed viewers consists of Ph.D. college students excited about optimization, combinatorics, or combinatorial algorithms.



Get Coupon

Join us on telegram for Course Updates

Join Whatsapp Group for Daily Free Courses

Leave a Reply

Your email address will not be published. Required fields are marked *