{"43283":{"#nid":"43283","#data":{"type":"event","title":"Reflections on a favorite child","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETITLE:\u003C\/strong\u003E Reflections on a favorite child\n\u003C\/p\u003E\n\u003Cp\u003E\u003Cstrong\u003ESPEAKER:\u003C\/strong\u003E  Dr. Harold W. Kuhn (Professor Emeritus, Princeton University)\n\u003C\/p\u003E\n\u003Cp\u003E\u003Cstrong\u003EABSTRACT:\u003C\/strong\u003E\n\u003C\/p\u003E\n\u003Cp\u003EFifty five years ago, two results of the Hungarian mathematicians, Koenig and Egervary, were combined using the duality theory of linear programming to construct the Hungarian Method for the Assignment Problem. In a recent reexamination of the geometric interpretation of the algorithm (proposed by Schmid in 1978) as a steepest descent method, several variations on the algorithm have been uncovered, which seem to deserve further study.\n\u003C\/p\u003E\n\u003Cp\u003EThe lecture will be self-contained, assuming little beyond the duality theory of linear programming. The Hungarian Method will be explained at an elementary level and will be illustrated by several examples.\n\u003C\/p\u003E\n\u003Cp\u003EWe shall conclude with account of a posthumous paper of Jacobi containing an algorithm developed by him prior to 1851 that is essentially identical to the Hungarian Method, thus anticipating the results of Koenig (1931), Egervary (1931), and Kuhn (1955) by many decades. \u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"Reflections on a favorite child","format":"limited_html"}],"field_summary_sentence":[{"value":"Reflections on a favorite child"}],"uid":"27187","created_gmt":"2009-10-12 20:37:40","changed_gmt":"2016-10-08 01:47:34","author":"Anita Race","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2008-11-13T15:30:00-05:00","event_time_end":"2008-11-13T16:30:00-05:00","event_time_end_last":"2008-11-13T16:30:00-05:00","gmt_time_start":"2008-11-13 20:30:00","gmt_time_end":"2008-11-13 21:30:00","gmt_time_end_last":"2008-11-13 21:30:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"1242","name":"School of Industrial and Systems Engineering (ISYE)"}],"categories":[],"keywords":[{"id":"5635","name":"Duality theory"},{"id":"5636","name":"linear programming"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cstrong\u003EAnita  Race\u003C\/strong\u003E\u003Cbr \/\u003EH. Milton Stewart School of Industrial and Systems Engineering\u003Cbr \/\u003E\u003Ca href=\u0022http:\/\/www.gatech.edu\/contact\/index.html?id=ar9\u0022\u003EContact Anita  Race\u003C\/a\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}