

{"id":63,"date":"2016-02-24T12:03:04","date_gmt":"2016-02-24T11:03:04","guid":{"rendered":"http:\/\/project.inria.fr\/2015ma2827\/?page_id=63"},"modified":"2017-06-06T15:08:18","modified_gmt":"2017-06-06T13:08:18","slug":"lectures","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/2015ma2827\/lectures\/","title":{"rendered":"Lectures"},"content":{"rendered":"<p>Each lecture will be conducted as two 1h30 sessions, with a 15min. break in between.<\/p>\n<p>Slides will be available here after the lecture. Some of the powerpoint slides were made on a Mac, and may not be completely compatible with the versions on Windows. The animations in some of the\u00a0PPTX files\u00a0will not be visible in the PDFs.<\/p>\n<table style=\"width: 100%;\">\n<tbody>\n<tr>\n<td>29\/03, 14:00<\/td>\n<td>Introduction (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/03\/DOIntro.pdf\">pdf<\/a>)<!--Introduction (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Intro.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Intro.pdf\">PDF<\/a>)\nLecture 1, Shortest paths (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/lecture1.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/lecture1.pdf\">PDF<\/a>)\nAssignment 1, Shortest paths (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/task1.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/task1.pdf\">PDF<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/DO_task1_2016.zip\">ZIP<\/a>)--><br \/>\nShortest Paths (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/03\/DOlecture1.pptx\">pptx<\/a>)(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/lecture1.pdf\">pdf<\/a>)<\/td>\n<td><i>Assignment 1 is given<\/i><\/td>\n<\/tr>\n<tr>\n<td>05\/04, 14:00<\/td>\n<td>Graph algorithms<br \/>\nPart 1 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture02_Part01.pptx\">pptx<\/a>)(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture02_Part01.pdf\">pdf<\/a>)<br \/>\nPart 2 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture02_Part02.pptx\">pptx<\/a>)(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture02_Part02.pdf\">pdf<\/a>)<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>07\/04, 14:00<\/td>\n<td>Lab session 1 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/LectureLab01.pptx\">pptx<\/a>)(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/LectureLab01.pdf\">pdf<\/a>)<!--, Shortest paths and graph algorithms (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/LectureLab01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/LectureLab01.pdf\">PDF<\/a>)\n--><\/td>\n<td><i>Discuss assignment 1<\/i><\/td>\n<\/tr>\n<tr>\n<td>26\/04, 14:00<\/td>\n<td>Dynamic programming, part 1<br \/>\n(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture03_Part01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture03_Part01.pdf\">PDF<\/a>)<\/td>\n<td><i>Assignment 2 is given<\/i><\/td>\n<\/tr>\n<tr>\n<td>28\/04, 14:00<\/td>\n<td>Lab session 2, Dynamic programming, part 2<br \/>\n(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture03_Part02-1.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/04\/Lecture03_Part02-1.pdf\">PDF<\/a>)<\/td>\n<td><i>Discuss assignment 2<\/i><\/td>\n<\/tr>\n<tr>\n<td>03\/05, 14:00<\/td>\n<td>Lecture 4<br \/>\nPart 0, Blackjack (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture04_Part00.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture04_Part00.pdf\">PDF<\/a>)<br \/>\nPart 1, P, NP, NP-Complete (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture04_Part01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture04_Part01.pdf\">PDF<\/a>)<br \/>\nPart 2, Menger&#8217;s Theorem (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture04_Part02.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture04_Part02.pdf\">PDF<\/a>)<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>05\/05, 14:00<\/td>\n<td>Approximate methods: local search<br \/>\n(<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture05-may2017.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2017\/05\/Lecture05-may2017.pdf\">PDF<\/a>)<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>10\/05, 14:00<\/td>\n<td>Lecture 6<br \/>\nPart 1, Linear Programming (<!--<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part01.pptx\">PPTX<\/a>,--> <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part01.pdf\">PDF<\/a>)<br \/>\nPart 2, Mixed Integer Programming, Duality (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part02.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part02.pdf\">PDF<\/a>)<\/td>\n<td><i>Assignment 3 is given<\/i><\/td>\n<\/tr>\n<tr>\n<td>12\/05, 14:00<\/td>\n<td>Lab session 3<!--, Duality, MIP, TSP--><\/td>\n<td><i>Discuss assignment 3<\/i><\/td>\n<\/tr>\n<tr>\n<td>24\/05, 14:00<\/td>\n<td>Lecture 7<br \/>\nConstraint programming (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/06\/Lecture07.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/06\/Lecture07.pdf\">PDF<\/a>)<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>31\/05, 14:00<\/td>\n<td>Lecture 8<br \/>\nPrimal and dual\u00a0formulations of maximum flow, Lagrangian dual, dual decomposition (on the white board) + sample exam questions<\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>07\/06, 14:00<\/td>\n<td>Exam<\/td>\n<td><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><!--\n2015\n\n\n<table style=\"width: 100%;\">\n\n\n<tbody>\n\n\n<tr>\n\n\n<td>01\/04, 08:00<\/td>\n\n\n\n\n<td>Introduction (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Intro.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Intro.pdf\">PDF<\/a>)\nLecture 1, Shortest paths (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/lecture1.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/lecture1.pdf\">PDF<\/a>)\nAssignment 1, Shortest paths (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/task1.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/task1.pdf\">PDF<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/DO_task1_2016.zip\">ZIP<\/a>)<\/td>\n\n\n\n\n<td><i>Assignment 1 is given<\/i><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>04\/04, 14:00<\/td>\n\n\n\n\n<td>Lecture 2, Graph algorithms\nPart 1 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Lecture02_Part01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Lecture02_Part01.pdf\">PDF<\/a>)\nPart 2 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Lecture02_Part02.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Lecture02_Part02.pdf\">PDF<\/a>)<\/td>\n\n\n\n\n<td><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>11\/04, 14:00<\/td>\n\n\n\n\n<td>Lab session 1, Shortest paths and graph algorithms (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/LectureLab01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/LectureLab01.pdf\">PDF<\/a>)<\/td>\n\n\n\n\n<td><i>Discuss assignment 1<\/i><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>15\/04, 08:00<\/td>\n\n\n\n\n<td>Lecture 3, Dynamic programming, part 1 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Lecture03_Part01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/04\/Lecture03_Part01.pdf\">PDF<\/a>)\nAssignment 2 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/DO_task2_2016.zip\">ZIP<\/a>)<\/td>\n\n\n\n\n<td><i>Assignment 2 is given<\/i><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>02\/05, 14:00<\/td>\n\n\n\n\n<td>Lab session 2, Dynamic programming, part 2 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture03_Part02.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture03_Part02.pdf\">PDF<\/a>)<\/td>\n\n\n\n\n<td><i>Discuss assignment 2<\/i><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>09\/05, 14:00<\/td>\n\n\n\n\n<td>Lecture 4\nPart 1, P, NP, NP-Complete (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture04_Part01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture04_Part01.pdf\">PDF<\/a>)\nPart 2, Menger's Theorem (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture04_Part02.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture04_Part02.pdf\">PDF<\/a>)<\/td>\n\n\n\n\n<td><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>13\/05, 08:00<\/td>\n\n\n\n\n<td>Lecture 5, Local search (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture05.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture05.pdf\">PDF<\/a>)\nAssignment 3 (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/DO_task3_2016.zip\">ZIP<\/a>)<\/td>\n\n\n\n\n<td><i>Assignment 3 is given<\/i><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>23\/05, 14:00<\/td>\n\n\n\n\n<td>Lecture 6\nPart 1, Linear Programming (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part01.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part01.pdf\">PDF<\/a>)\nPart 2, Mixed Integer Programming, Duality (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part02.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/05\/Lecture06_Part02.pdf\">PDF<\/a>)<\/td>\n\n\n\n\n<td><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>27\/05, 08:00<\/td>\n\n\n\n\n<td>Lab session 3, Duality, MIP, TSP<\/td>\n\n\n\n\n<td><i>Discuss assignment 3<\/i><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>30\/05, 14:00<\/td>\n\n\n\n\n<td>Lecture 7, Constraint programming, (<a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/06\/Lecture07.pptx\">PPTX<\/a>, <a href=\"http:\/\/project.inria.fr\/2015ma2827\/files\/2016\/06\/Lecture07.pdf\">PDF<\/a>)<\/td>\n\n\n\n\n<td><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>03\/06, 08:00<\/td>\n\n\n\n\n<td>Lecture 8, primal and dual\u00a0formulations of maximum flow,\nLagrangian dual, dual decomposition (on the white board)<\/td>\n\n\n\n\n<td><\/td>\n\n\n<\/tr>\n\n\n\n\n<tr>\n\n\n<td>06\/06, 14:00<\/td>\n\n\n\n\n<td>Exam<\/td>\n\n\n\n\n<td><\/td>\n\n\n<\/tr>\n\n\n<\/tbody>\n\n\n<\/table>\n\n\n--><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Each lecture will be conducted as two 1h30 sessions, with a 15min. break in between. Slides will be available here after the lecture. Some of the powerpoint slides were made on a Mac, and may not be completely compatible with the versions on Windows. The animations in some of the\u00a0PPTX\u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/2015ma2827\/lectures\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":921,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-63","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages\/63","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/users\/921"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/comments?post=63"}],"version-history":[{"count":51,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages\/63\/revisions"}],"predecessor-version":[{"id":287,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages\/63\/revisions\/287"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/media?parent=63"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}