BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Hypergraphs for Team Formation and Constrained Com
 binatorial Optimization - Tina Eliassi-Rad (Northe
 astern University)
DTSTART;TZID=Europe/London:20240812T150000
DTEND;TZID=Europe/London:20240812T163000
UID:TALK219328AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/219328
DESCRIPTION:Hypergraphs are useful mathematical representation
 s for numerous applications. In this talk\, I will
  present two examples: (1) team formation and (2) 
 constrained combinatorial optimization. First\, I 
 will discuss the problem of assigning entities to 
 teams as hypergraph discovery\, where we optimize 
 for hypergraphs that are resilient and optimized f
 or diffusion. Second\, I will discuss how encoding
  higher-order constraints as hyperedges and learni
 ng hypergraph neural networks provide scalable and
  generalizable solutions to constrained combinator
 ial optimization problems. The papers for the talk
  are at https://arxiv.org/abs/2403.04063&nbsp\;and
  https://doi.org/10.1038/s42256-024-00833-7.&nbsp\
 ;
LOCATION:External
CONTACT:
END:VEVENT
END:VCALENDAR