BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20191202T103000
DTEND;TZID=UTC:20191202T233000
DTSTAMP:20260405T204634
CREATED:20190723T135610Z
LAST-MODIFIED:20190916T101732Z
UID:1290-1575282600-1575329400@optimisation.doc.ic.ac.uk
SUMMARY:Seminar by prof. Miguel Anjos
DESCRIPTION:Professor Miguel Anjos from the University of Edinburgh is giving a seminar on: Tight-and-Cheap Conic Relaxations for AC Optimal Power Flow and Optimal Reactive Power Dispatch \n  \nAbstract: The classical alternating current optimal power flow problem is nonconvex and generally hard to solve. We propose a new conic relaxation obtained by combining semidefinite optimization with RLT. The proposed relaxation is stronger than the second-order cone relaxation\, competitive with the recently proposed QC relaxation\, and up to one order of magnitude faster than for the semidefinite chordal approach on benchmarks with up to 6515 nodes\, with comparable global bounds. We extend the approach to optimal reactive power dispatch\, which requires the introduction of binary and integer variables\, and obtain with similar results and performance.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-by-prof-miguel-anjos/
LOCATION:Huxley 217
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191206T140000
DTEND;TZID=UTC:20191206T153000
DTSTAMP:20260405T204634
CREATED:20191205T141856Z
LAST-MODIFIED:20191205T141940Z
UID:1432-1575640800-1575646200@optimisation.doc.ic.ac.uk
SUMMARY:Seminar by  Associate Professor Jakob Nordström
DESCRIPTION:TITLE:\nLearn to Relax: Integrating Integer Linear Programming with Conflict-Driven Search\n\n  \nABSTRACT:\nPseudo-Boolean (PB) solvers optimize 0-1 integer linear programs by\nextending the conflict-driven learning paradigm from SAT solving.\nThough PB solvers should be exponentially more efficient than SAT\nsolvers in theory\, in practice they can sometimes get hopelessly stuck\neven when the relaxed linear program (LP) is infeasible over the\nreals.  Inspired by mixed integer programming (MIP)\, we address this\nproblem by interleaving incremental LP solving with cut generation\nwithin the conflict-driven PB search.  This hybrid approach\, which for\nthe first time combines MIP techniques with full-blown conflict\nanalysis over linear inequalities using the cutting planes method\,\nsignificantly improves performance on a wide range of benchmarks\,\napproaching a “best of two worlds” scenario between SAT-style\nconflict-driven search and MIP-style branch-and-cut.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-by-associate-professor-jakob-nordstrom/
LOCATION:Huxley 217
END:VEVENT
END:VCALENDAR