BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Elina Rönnberg (Linköpings universitet) DTSTART:20261116T121500Z DTEND:20261116T130000Z DTSTAMP:20261106T185837Z UID:cam/108 DESCRIPTION:Title: De composition methods for mixed-integer linear programming\nby Elina Rö nnberg (Linköpings universitet) as part of CAM seminar\n\nLecture held in MV:L14.\n\nAbstract\nMany decision problems in industry and society\, suc h as vehicle routing\, scheduling and air traffic planning\, can be modell ed as mixed-integer linear programs (MILPs). No polynomial-time methods ar e known for these problems in general. Modern MILP solvers are remarkably capable\, but large-scale applications often call for exploiting the probl em structure even further. Decomposition methods do this by splitting a pr oblem into parts that are coordinated through a feedback mechanism\, while retaining optimality guarantees. I will present some fundamental concepts behind two decomposition approaches. The first is Dantzig-Wolfe decomposi tion\, where a reformulation in a higher-dimensional space can give a much stronger model\, which is solved by branch-price-and-cut. The second is l ogic-based Benders decomposition\, which is well suited to “assign then schedule” problems. Since the seminar series has a broad applied mathema tics audience\, most of the talk will be introductory. For the optimisatio n experts\, I will also briefly mention the directions of our ongoing rese arch projects.\n LOCATION:https://researchseminars.org/talk/cam/108/ END:VEVENT END:VCALENDAR