Subject: Subject Sylbus: Combinatorial Optimization - 236718

Combinatorial Optimization - 236718
Will not be given the year
Credit
Points
3.0
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1      

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: Algebra a 104167
or Graph Algorithms 234246
 
Overlapping Courses: Linear and Combinatorial Programming 098331


Introduction: Definition of the Problem as An Integer Linear Problem, Linear Inequalities and Polyhedra, Linear Programming and Primal-Dual Algorithms. the Matching Problem: Maximum and Perfect, Bipartite and General Graphs. the Hungarian Method. Tutte'S Theorem. Edmond'S Algorithm and the Matching Polytope. Applications in Solving Other Problems. the Chinese Postman Problem. Planar Graphs. Plane Multicommodity Flow. a Brief Survey of Advanced Topics Such as Matroids, the Ellipsoid Method and Its Applications, Graph-Minors.




Textbooks
PublishedPublisherAuthorsBook
1976holt rinehart and whinston,new-yorke.l. lawlercombinatorial optimization network flows and matro
1982prentice-hall,n.j.c.h. papadimitriou and k.steiglitecombinatorial optimization algorithms and complex'

Created in 22/04/2021 Time 14:42:41