{"id":4,"date":"2011-12-08T11:55:34","date_gmt":"2011-12-08T11:55:34","guid":{"rendered":"http:\/\/project.inria.fr\/template1\/?page_id=4"},"modified":"2017-03-13T17:43:15","modified_gmt":"2017-03-13T16:43:15","slug":"home","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/2015ma2827\/","title":{"rendered":"About"},"content":{"rendered":"<p>The introduction to discrete optimization (MA2827) course at Ecole Centrale Paris will be taught by <a href=\"http:\/\/lear.inrialpes.fr\/~alahari\">Karteek Alahari<\/a> (Inria Grenoble &#8211; Rhone-Alpes) and <a href=\"http:\/\/www-sop.inria.fr\/members\/Yuliya.Tarabalka\/\">Yuliya Tarabalka<\/a> (Inria Sophia Antipolis &#8211;\u00a0M\u00e9diterran\u00e9e)\u00a0in the 2016-&#8217;17 academic year.<\/p>\n<p>Discrete optimization is concerned with the subset of optimization problems where some or all of the variables are confined to take a value from a discrete set. Examples include several important problems in various fields of applied mathematics and computer science, such as<\/p>\n<ul>\n<li>Finding the best (shortest, cheapest, most scenic) route from one place to another.<\/li>\n<li>Connecting cities using a road network that minimizes the cost.<\/li>\n<li>Selecting a subset of projects, each requiring a subset of available resources, to maximize profit.<\/li>\n<li>Finding the best assignment of students to universities.<\/li>\n<\/ul>\n<p>In this course, we will study the fundamental concepts of discrete optimization such as greedy algorithms, dynamic programming and min-max relationships. Each concept will be illustrated using well-known problems such as shortest paths, minimum spanning tree, min-cut and max-flow. We will also identify which problems are <i>easy<\/i> and which problems are <i>hard<\/i>, and discuss how to obtain an approximate solution to hard problems.<\/p>\n<p>In 2015-&#8217;16 this course was taught by Karteek Alahari and\u00a0<a href=\"http:\/\/www.di.ens.fr\/~aosokin\/\">Anton Osokin<\/a> (Inria de Paris), and by <a href=\"http:\/\/mpawankumar.info\/\">M. Pawan Kumar<\/a>\u00a0before that.<\/p>","protected":false},"excerpt":{"rendered":"<p>The introduction to discrete optimization (MA2827) course at Ecole Centrale Paris will be taught by Karteek Alahari (Inria Grenoble &#8211; Rhone-Alpes) and Yuliya Tarabalka (Inria Sophia Antipolis &#8211;\u00a0M\u00e9diterran\u00e9e)\u00a0in the 2016-&#8217;17 academic year. Discrete optimization is concerned with the subset of optimization problems where some or all of the variables are\u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/2015ma2827\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-4","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages\/4","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\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/comments?post=4"}],"version-history":[{"count":13,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages\/4\/revisions"}],"predecessor-version":[{"id":212,"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/pages\/4\/revisions\/212"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/2015ma2827\/wp-json\/wp\/v2\/media?parent=4"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}