<node id="70402">
  <nid>70402</nid>
  <type>news</type>
  <uid>
    <user id="27511"><![CDATA[27511]]></user>
  </uid>
  <created>1317302802</created>
  <changed>1653584976</changed>
  <title><![CDATA[Dadush Wins INFORMS Optimization Society Student Paper Prize]]></title>
  <body><![CDATA[<p>Daniel Dadush,
an Algorithms, Combinatorics, and Optimization (ACO) PhD student at Georgia Tech, based
in the H. Milton Stewart School of Industrial and Systems Engineering (ISyE), was
selected as the winner of the <a href="http://www.informs.org/Community/Optimization-Society/Optimization-Society-Prizes/Student-Paper-Prize">2011 INFORMS Optimization Society Student Paper
Prize</a> for his paper “On the Chvatal-Gomory Closure of a Compact Convex Set.” &nbsp;The paper was co-authored with Santanu Dey,
assistant professor in ISyE, and Juan Pablo Vielma, who received his PhD from
ISyE in 2009 and was the 2007 recipient of the Optimization Society Student
Paper Prize. Vielma is currently the assistant professor in the department of
Industrial Engineering at the University of Pittsburgh. The prize is awarded
annually at the INFORMS Fall National Meeting for an outstanding paper in
optimization by a student author.</p>

<p>The citation reads:</p>



<p>"The paper shows that the Chvátal-Gomory closure of
compact convex sets is a rational polytope. For the special case of rational
polytopes, this is a well-known result. The new result includes the case of
irrational polytopes and thus resolves a question that was posed by Schrijver (1980)
and had remained open since. Solving this long-open question is already a
wonderful contribution, finally completing the Chvátal-Gomory theory for
polytopes. The paper goes beyond this and also provides a solution for
arbitrary compact convex sets, completing the program started in a paper by Dey
and Vielma (2010) for the case of ellipsoids and continued in an earlier paper
by Dadush, Dey, and Vielma (2011) for the case of strictly convex bodies. The importance
of this contribution lies in providing a foundation for a finite linear cutting
plane theory for convex integer optimization. </p>



<p>The paper uses techniques from convex geometry and the
geometry of numbers in an expertly way. In the proofs, the authors avoid
explicit calculations in favor of soft analysis, including techniques from point-set
topology, which makes the paper particularly elegant." </p>

<p>The <a href="http://meetings2.informs.org/charlotte2011/">2011 INFORMS Annual Meeting</a> will be held at the
Charlotte Convention Center in Charlotte, North Carolina on November 13,
2011.&nbsp; INFORMS, the largest professional society in the world for
professionals in the field of operations research (OR), management science, and
business analytics, serves the scientific and professional needs of Operations
Researchers and those in the Management Sciences including educators,
scientists, students, managers, and consultants.</p>]]></body>
  <field_subtitle>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_subtitle>
  <field_dateline>
    <item>
      <value>2011-09-29T00:00:00-04:00</value>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_dateline>
  <field_summary_sentence>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Daniel Dadush,
an Algorithms, Combinatorics, and Optimization (ACO) PhD student at Georgia Tech, based in the H. Milton Stewart School of Industrial and Systems Engineering (ISyE), was
selected as the winner of the 2011 INFORMS Optimization Society Student Paper
Prize for his paper “On the Chvatal-Gomory Closure of a Compact Convex Set.”</p>]]></value>
    </item>
  </field_summary>
  <field_media>
      </field_media>
  <field_contact_email>
    <item>
      <email><![CDATA[barbara.christopher@isye.gatech.edu]]></email>
    </item>
  </field_contact_email>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_contact>
    <item>
      <value><![CDATA[<p>Industrial and Systems Engineering</p>]]></value>
    </item>
  </field_contact>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <!--  TO DO: correct to not conflate categories and news room topics  -->
  <!--  Disquisition: it's funny how I write these TODOs and then never
         revisit them. It's as though the act of writing the thing down frees me
         from the responsibility to actually solve the problem. But what can I
         say? There are more problems than there's time to solve.  -->
  <links_related> </links_related>
  <files> </files>
  <og_groups>
          <item>1242</item>
      </og_groups>
  <og_groups_both>
          <item>
        <![CDATA[Student and Faculty]]>
      </item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>134</tid>
        <value><![CDATA[Student and Faculty]]></value>
      </item>
      </field_categories>
  <core_research_areas>
      </core_research_areas>
  <field_news_room_topics>
      </field_news_room_topics>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>1242</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[School of Industrial and Systems Engineering (ISYE)]]></item>
      </og_groups_both>
  <field_keywords>
          <item>
        <tid>14476</tid>
        <value><![CDATA[Daniel Dadush]]></value>
      </item>
          <item>
        <tid>6204</tid>
        <value><![CDATA[INFORMS]]></value>
      </item>
          <item>
        <tid>426</tid>
        <value><![CDATA[isye]]></value>
      </item>
          <item>
        <tid>1123</tid>
        <value><![CDATA[Juan Pablo Vielma]]></value>
      </item>
          <item>
        <tid>8024</tid>
        <value><![CDATA[Optimization Society Student Paper Prize]]></value>
      </item>
          <item>
        <tid>167192</tid>
        <value><![CDATA[Santanu Dey]]></value>
      </item>
      </field_keywords>
  <field_userdata>
      <![CDATA[]]>
  </field_userdata>
</node>
