BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20260308T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20261101T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20261002T182807Z
UID:31DBD734-DE06-4B1F-BF2F-8FFF20299456
DTSTART;TZID=America/New_York:20261009T130000
DTEND;TZID=America/New_York:20261009T140000
DESCRIPTION:We propose an extension of Relax-and-Round Unit Commitment (RRU
 C) that is capable of committing generating units for larger problems fast
 er than conventional methods\, while staying within intertemporal and spat
 ial megavolt-ampere constraints. We demonstrate the performance of RRUC us
 ing synthetic congestible test systems ranging from 100 to 20\,000 buses. 
 RRUC consistently finds low-cost solutions\, independent of the problem si
 ze\, and its run time increases sub-quadratically in the number of buses. 
 RRUC can solve the full alternating current optimal power flow (ACOPF) 100
  bus system in less than a second and the 20\,000-bus system in 7 minutes.
  In contrast\, a leading state of the art solver cannot find a feasible so
 lution to the full ACOPF 100 bus system in 15 minutes.\n\nJoin: https://te
 ams.microsoft.com/meet/238073195166946?p=ZF2dNIkI2brwrSLvgw\n\nMeeting ID:
  238 073 195 166 946\n\nPasscode: wG9w5px3\n\nCo-sponsored by: IEEE TEC Ea
 st Tennessee Chapter\n\nVirtual: https://events.vtools.ieee.org/m/581783
LOCATION:Virtual: https://events.vtools.ieee.org/m/581783
ORGANIZER:l.riello@ieee.org
SEQUENCE:18
SUMMARY:IEEE TEC East Tennessee Chapter Guest Lecture with Shaked Regev - F
 ast Transmission-Constrained Unit Commitment
URL;VALUE=URI:https://events.vtools.ieee.org/m/581783
X-ALT-DESC:Description: &lt;br /&gt;&lt;p&gt;We propose an extension of Relax-and-Round
  Unit Commitment (RRUC) that is capable of committing generating units for
  larger problems faster than conventional methods\, while staying within i
 ntertemporal and spatial megavolt-ampere constraints. We demonstrate the p
 erformance of RRUC using synthetic congestible test systems ranging from 1
 00 to 20\,000 buses. RRUC consistently finds low-cost solutions\, independ
 ent of the problem size\, and its run time increases sub-quadratically in 
 the number of buses. RRUC can solve the full alternating current optimal p
 ower flow (ACOPF) 100 bus system in less than a second and the 20\,000-bus
  system in 7 minutes. In contrast\, a leading state of the art solver cann
 ot find a feasible solution to the full ACOPF 100 bus system in 15 minutes
 .&lt;/p&gt;\n&lt;p&gt;Join: &lt;a href=&quot;https://teams.microsoft.com/meet/238073195166946?
 p=ZF2dNIkI2brwrSLvgw&quot;&gt;https://teams.microsoft.com/meet/238073195166946?p=Z
 F2dNIkI2brwrSLvgw&lt;/a&gt;&lt;/p&gt;\n&lt;p&gt;Meeting ID: 238 073 195 166 946&lt;/p&gt;\n&lt;p&gt;Pass
 code: wG9w5px3&lt;/p&gt;
END:VEVENT
END:VCALENDAR

