BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ALOP - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ALOP
X-ORIGINAL-URL:https://alop.uni-trier.de
X-WR-CALDESC:Events for ALOP
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190701T160000
DTEND;TZID=Europe/Berlin:20190701T180000
DTSTAMP:20190531T114609Z
CREATED:20190524T065935Z
LAST-MODIFIED:20190531T114609Z
UID:2810-1561996800-1562004000@alop.uni-trier.de
SUMMARY:ALOP Colloquium with Christopher Hojny\, TU Darmstadt
DESCRIPTION:On Monday\, July 1 2019 at 16:00 c.t.  Dr. Christopher Hojny\, TU Darmstadt  will present his recent work entitled Symmetry Handling in Binary Programs – Combining Symretopes and Orbital Fixing \n  \nAbstract: \nBranch-and-bound is an established method to solve binary programs with thousands of variables in adequate time. If symmetries are present\, however\, even small instances may be hard to solve\, because symmetric parts of the branch-and-bound tree are inspected repeatedly without providing new information. A standard way to handle symmetries in binary programs is to add inequalities that cut off solutions that are lexicographically not maximal in their symmetry classes (orbits). \n  \nIn this talk\, we focus on an approach that generalizes most of the known inequalities. We consider symretopes\, which are the convex hull of all binary vectors that are lexicographically maximal in their orbits. Thus\, adding inequalities of an IP formulation for symretopes to a binary program removes all the symmetry of the program. To derive a tractable IP formulation\, we consider symresacks\, which are knapsack polytopes that are defined by a single symmetry handling inequality. We prove that the optimization problem over symresacks and the separation problem of minimal cover inequalities for symresacks can be solved in almost linear time. This yields an efficiently separable and numerical stable IP formulation of symretopes. \n  \nAnother way to handle symmetries is to fix binary variables if one can show that fixing the variables to the complementary value cannot lead to a lexicographically maximal solution\, so-called orbital fixing. While symmetry handling inequalities and orbital fixing are incompatible\, in general\, we demonstrate how both can be used in parallel if the corresponding problem decomposes in an appropriate way. Numerical experiments show that using both approaches simultaneously improves on using either of these methods. \n  \n  \nThe presentation will take place in HS 9. \n  \nPlease join us for coffee at 15:45 in E10. \n 
URL:https://alop.uni-trier.de/event/alop-colloquium-with-christopher-hojny-tu-darmstadt/
LOCATION:Trier University E Building\, Universitätsring 15\, Trier\, 54296\, Germany
CATEGORIES:Colloquium
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
END:VCALENDAR