{"id":1569,"date":"2015-04-07T14:20:29","date_gmt":"2015-04-07T12:20:29","guid":{"rendered":"http:\/\/www.mi.uni-koeln.de\/opt\/?page_id=1569"},"modified":"2015-04-23T11:09:14","modified_gmt":"2015-04-23T09:09:14","slug":"vorlesungen","status":"publish","type":"page","link":"http:\/\/www.mi.uni-koeln.de\/opt\/veranstaltungen\/or2015\/vorlesungen\/","title":{"rendered":"Operations Research &#8211; Vorlesungen"},"content":{"rendered":"<p>Handschriftliche Vorlesungsnotizen:<br \/>\n\n<table id=\"tablepress-10\" class=\"tablepress tablepress-id-10\">\n<thead>\n<tr class=\"row-1\">\n\t<th class=\"column-1\">Datum<\/th><th class=\"column-2\">Aufzeichnungen<\/th><th class=\"column-3\">Inhaltsverzeichnis<\/th>\n<\/tr>\n<\/thead>\n<tbody class=\"row-striping row-hover\">\n<tr class=\"row-2\">\n\t<td class=\"column-1\">Di. 07.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL01.pdf\">Vorlesung 1<\/a><\/td><td class=\"column-3\"><b>Teil A - Graphen und Netzwerke, kombinatorische Algorithmen<\/b><br \/>\n<b>Kapitel I - K\u00fcrzeste Wege<\/b><br \/>\n&sect;1 Grundbegriffe<br \/>\n&sect;2 Potentiale <\/td>\n<\/tr>\n<tr class=\"row-3\">\n\t<td class=\"column-1\">Fr. 10.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL02.pdf\">Vorlesung 2<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-4\">\n\t<td class=\"column-1\">Di. 14.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL03.pdf\">Vorlesung 3<\/a><\/td><td class=\"column-3\">&sect;3 Berechnung k\u00fcrzester Wege<br \/>\n<b>Kapitel II - Matchings in bipartiten Graphen<\/b><br \/>\n&sect;1 Grundbegriffe <\/td>\n<\/tr>\n<tr class=\"row-5\">\n\t<td class=\"column-1\">Fr. 17.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL04.pdf\">Vorlesung 4<\/a><\/td><td class=\"column-3\">&sect;2 Berechnung von Matchings mit maximaler Kardinalit\u00e4t <\/td>\n<\/tr>\n<tr class=\"row-6\">\n\t<td class=\"column-1\">Di. 21.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL05.pdf\">Vorlesung 5<\/a><\/td><td class=\"column-3\">&sect;3 Das Matchingtheorem von K\u00f6nig<\/td>\n<\/tr>\n<tr class=\"row-7\">\n\t<td class=\"column-1\">Fr. 24.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL06.pdf\">Vorlesung 6<\/a><\/td><td class=\"column-3\">&sect;4 Die ungarische Methode: Berechnung von Matchings mit maximalem Gewicht<\/td>\n<\/tr>\n<tr class=\"row-8\">\n\t<td class=\"column-1\">Di. 28.04.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/04\/OR2015-VL07.pdf\">Vorlesung 7<\/a><\/td><td class=\"column-3\"><b>Kapitel III - Fl\u00fcsse in Netzwerken<\/b><br \/>\n&sect;1 Das Max-Flow-Min-Cut Theorem<\/td>\n<\/tr>\n<tr class=\"row-9\">\n\t<td class=\"column-1\">Di. 05.05.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/05\/OR2015-VL08.pdf\">Vorlesung 8<\/a><\/td><td class=\"column-3\"><b>Teil B - Einf\u00fchrung in die lineare Optimierung<\/b><br \/>\n<b>Kapitel IV - Konvexe Mengen<\/b><br \/>\n&sect;1 Motivation<\/td>\n<\/tr>\n<tr class=\"row-10\">\n\t<td class=\"column-1\">Fr. 08.05.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/05\/OR2015-VL09.pdf\">Vorlesung 9<\/a><\/td><td class=\"column-3\">&sect;2 Grundbegriffe<\/td>\n<\/tr>\n<tr class=\"row-11\">\n\t<td class=\"column-1\">Di. 12.05.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/05\/OR2015-VL10.pdf\">Vorlesung 10<\/a><\/td><td class=\"column-3\">&sect;3 Trennungss\u00e4tze<\/td>\n<\/tr>\n<tr class=\"row-12\">\n\t<td class=\"column-1\">Fr. 15.05.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/05\/OR2015-VL11.pdf\">Vorlesung 11<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-13\">\n\t<td class=\"column-1\">Di. 19.05.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/05\/OR2015-VL12.pdf\">Vorlesung 12<\/a><\/td><td class=\"column-3\">&sect;4 Konische Optimierung<\/td>\n<\/tr>\n<tr class=\"row-14\">\n\t<td class=\"column-1\">Fr. 22.05.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/05\/OR2015-VL13.pdf\">Vorlesung 13<\/a><\/td><td class=\"column-3\"><b>Kapitel V - Polyedertheorie<\/b><br \/>\n&sect;1 Extrempunkte und Ecken<\/td>\n<\/tr>\n<tr class=\"row-15\">\n\t<td class=\"column-1\">Di. 02.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL14.pdf\">Vorlesung 14<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-16\">\n\t<td class=\"column-1\">Fr. 05.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL15.pdf\">Vorlesung 15<\/a><\/td><td class=\"column-3\">&sect;2 Eliminationsverfahren von Fourier und Motzkin<br \/>\n&sect;3 Lemma von Farkas<\/td>\n<\/tr>\n<tr class=\"row-17\">\n\t<td class=\"column-1\">Di. 09.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL16.pdf\">Vorlesung 16<\/a><\/td><td class=\"column-3\">&sect;4 Lineare Programmierung<\/td>\n<\/tr>\n<tr class=\"row-18\">\n\t<td class=\"column-1\">Fr. 12.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL17.pdf\">Vorlesung 17<\/a><\/td><td class=\"column-3\"><b>Kapitel VI - Ganzzahlige lineare Optimierung und vollst\u00e4ndig unimodulare Matrizen<\/b><br \/>\n&sect;1 Ganzzahlige lineare Programme<\/td>\n<\/tr>\n<tr class=\"row-19\">\n\t<td class=\"column-1\">Di. 16.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL18.pdf\">Vorlesung 18<\/a><\/td><td class=\"column-3\">&sect;2 Vollst\u00e4ndig unimodulare Matrizen<br \/>\n&sect;3 Vollst\u00e4ndig unimodulare Matrizen und bipartite Graphen<\/td>\n<\/tr>\n<tr class=\"row-20\">\n\t<td class=\"column-1\">Fr. 19.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL19.pdf\">Vorlesung 19<\/a><\/td><td class=\"column-3\">&sect;4 Vollst\u00e4ndig unimodulare Matrizen und gerichtete Graphen<\/td>\n<\/tr>\n<tr class=\"row-21\">\n\t<td class=\"column-1\">Di. 23.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL20.pdf\">Vorlesung 20<\/a><\/td><td class=\"column-3\">&sect;5 Charakterisierung vollst\u00e4ndig unimodularer Matrizen<\/td>\n<\/tr>\n<tr class=\"row-22\">\n\t<td class=\"column-1\">Fr. 26.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL21.pdf\">Vorlesung 21<\/a><\/td><td class=\"column-3\"><b>Teil C - Algorithmen der linearen Optimierung<\/b><br \/>\n<b>Kapitel VII - Das Simplexverfahren<\/b><br \/>\n<\/td>\n<\/tr>\n<tr class=\"row-23\">\n\t<td class=\"column-1\">Di. 30.06.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/06\/OR2015-VL22.pdf\">Vorlesung 22<\/a><\/td><td class=\"column-3\"><b>Kapitel VIII - Die Ellipsoidmethode<\/b><br \/>\n&sect;1 Grundlegendes zu Ellipsoiden<\/td>\n<\/tr>\n<tr class=\"row-24\">\n\t<td class=\"column-1\">Fr. 03.07.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/07\/OR2015-VL23.pdf\">Vorlesung 23<\/a><\/td><td class=\"column-3\">&sect;2 Trennen und Optimieren<\/td>\n<\/tr>\n<tr class=\"row-25\">\n\t<td class=\"column-1\">Di. 07.07.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/07\/OR2015-VL24.pdf\">Vorlesung 24<\/a><\/td><td class=\"column-3\"><\/td>\n<\/tr>\n<tr class=\"row-26\">\n\t<td class=\"column-1\">Fr. 10.07.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/07\/OR2015-VL25.pdf\">Vorlesung 25<\/a><\/td><td class=\"column-3\"><b>Kapitel IX - Spieltheorie<\/b><br \/>\n&sect;1 Bimatrix-Spiele<\/td>\n<\/tr>\n<tr class=\"row-27\">\n\t<td class=\"column-1\">Di. 14.07.2015<\/td><td class=\"column-2\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2015\/07\/OR2015-VL26.pdf\">Vorlesung 26<\/a><\/td><td class=\"column-3\">&sect;2 Matrixspiele<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<!-- #tablepress-10 from cache --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Handschriftliche Vorlesungsnotizen:<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":1359,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"sidebar-page.php","meta":{"footnotes":""},"class_list":["post-1569","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/1569","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/comments?post=1569"}],"version-history":[{"count":2,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/1569\/revisions"}],"predecessor-version":[{"id":1656,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/1569\/revisions\/1656"}],"up":[{"embeddable":true,"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/1359"}],"wp:attachment":[{"href":"http:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/media?parent=1569"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}