BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Amitabh Basu (Johns Hopkins University)
DTSTART:20200707T180000Z
DTEND:20200707T183000Z
DTSTAMP:20260423T021930Z
UID:DOTs/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/DOTs/18/">Pr
 ovable complexity bounds for integer programming algorithms</a>\nby Amitab
 h Basu (Johns Hopkins University) as part of Discrete Optimization Talks\n
 \n\nAbstract\nWe discuss the complexity of the two main ingredients in int
 eger optimization algorithms: cutting planes and branch-and-bound. We prov
 e upper and lower bounds on the efficiency of these algorithms\, when effi
 ciency is measured in terms of complexity of the LPs that are solved. More
  precisely\, we focus on the sparsity of the LPs and the number of LPs as 
 measures of complexity. Some connections with mathematical logic and proof
  complexity will also be discussed.\n
LOCATION:https://researchseminars.org/talk/DOTs/18/
END:VEVENT
END:VCALENDAR