![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tina Eliassi-Rad (Northeastern University)
Monday 12 August 2024, 15:00-16:30
Hypergraphs for Team Formation and Constrained Combinatorial Optimization
- đ¤ Speaker: Tina Eliassi-Rad (Northeastern University)
- đ Date & Time: Monday 12 August 2024, 15:00 - 16:30
- đ Venue: External
Abstract
Hypergraphs are useful mathematical representations 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 for diffusion. Second, I will discuss how encoding higher-order constraints as hyperedges and learning hypergraph neural networks provide scalable and generalizable solutions to constrained combinatorial optimization problems. The papers for the talk are at https://arxiv.org/abs/2403.04063 ;and https://doi.org/10.1038/s42256-024-00833-7.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- External
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
Note: Ex-directory lists are not shown.