BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Christopher Hojny (Eindhoven University of Technology)
DTSTART:20210526T160000Z
DTEND:20210526T163000Z
DTSTAMP:20260415T000256Z
UID:MIP2021/14
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/14/"
 >Computational Aspects of Relaxation Complexity</a>\nby Christopher Hojny 
 (Eindhoven University of Technology) as part of Mixed Integer Programming 
 Workshop 2021\n\n\nAbstract\nThe relaxation complexity rc(X) of a set of i
 nteger points X contained in a polyhedron is the smallest number of facets
  of any polyhedron P such that the integer points in P coincide with X. It
  is an important tool to investigate the existence of compact linear descr
 iptions of X. In this talk\, I will address computational aspects of relax
 ation complexity such as finding computable upper bounds on rc(X) or the e
 xact value of rc(X). For the latter\, I will show generic algorithmic appr
 oaches and provide explicit formulas for rc(X) for specific classes of set
 s X. \n\nThis is joint work with Gennadiy Averkov and Matthias Schymura.\n
LOCATION:https://researchseminars.org/talk/MIP2021/14/
END:VEVENT
END:VCALENDAR