BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Gregor Hendel (Fair Isaac Germany GmbH) DTSTART:20210525T171500Z DTEND:20210525T174500Z DTSTAMP:20260414T235721Z UID:MIP2021/9 DESCRIPTION:Title: Estimating the Branch-and-Bound Search Tree Size\nby Gregor Hendel (Fa ir Isaac Germany GmbH) as part of Mixed Integer Programming Workshop 2021\ n\n\nAbstract\n"When will this run finish?" is undoubtedly a popular quest ion among users of branch-and-bound based mixed integer programming solver s.\n\nIn this talk\, we focus on online estimations of the final tree size during the search. We first review existing measures of the search progre ss such as the (in-)famous gap\, and introduce a new measure called leaf-f requency. We then discuss and compare the suitability of the individual me asures as predictors of the final tree size either by direct projection or by time series forecasting. Finally\, we combine these measures as input of a simple Machine Learning model\, which significantly outperforms the p rediction accuracy of all individual measures. \n\nThis work manifests as a new display column in SCIP 7.0 that displays the approximate search prog ress percentage\, which can be trained further to user instances of intere st.\n LOCATION:https://researchseminars.org/talk/MIP2021/9/ END:VEVENT END:VCALENDAR