BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Hypergraphs for Team Formation and Constrained Combinatorial Optim
 ization - Tina Eliassi-Rad (Northeastern University)
DTSTART:20240812T140000Z
DTEND:20240812T153000Z
UID:TALK219328@talks.cam.ac.uk
DESCRIPTION:Hypergraphs are useful mathematical representations for numero
 us applications. In this talk\, I will present two examples: (1) team form
 ation and (2) constrained combinatorial optimization. First\, I will discu
 ss the problem of assigning entities to teams as hypergraph discovery\, wh
 ere we optimize for hypergraphs that are resilient and optimized for diffu
 sion. Second\, I will discuss how encoding higher-order constraints as hyp
 eredges and learning hypergraph neural networks provide scalable and gener
 alizable solutions to constrained combinatorial optimization problems. The
  papers for the talk are at https://arxiv.org/abs/2403.04063&nbsp\;and htt
 ps://doi.org/10.1038/s42256-024-00833-7.&nbsp\;
LOCATION:External
END:VEVENT
END:VCALENDAR