Topics in Combinatorial Optimization
10 votes
Free
|
||||||||||||||||||||||||||||||||||||
![]() |
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms. Starts :
2004-02-01 |
|||||||||||||||||||||||||||||||||||
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. Similar coursesCourses related to the course subject
|
Let us know when you did the course Topics in Combinatorial Optimization.

Add the course Topics in Combinatorial Optimization to My Personal Education Path.

Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.
