In the article, the authors propose a methodology for managing connections in a community based on the developed heuristic algorithm for optimal seating of participants in a multi-round networking event to maximize the likelihood of new partnerships within offline events. The seating algorithm is based on solving the NP-complete problem of the maximum clique. Optimization of the resulting solution is implemented based on the permutation crossover algorithm.

Keywords: In the article, the authors propose a methodology for managing connections in a community based on the developed heuristic algorithm for optimal seating of participants in a multi-round networking event to maximize the likelihood of new partnerships withi