New grant on optimization problems in complex networks

The US Air Force Office of Scientific Research has awarded the grant Algorithmic and theoretical approaches to optimization problems on complex networks to CNetS faculty Filippo Radicchi. The project will study different classes of optimization problems (OPs) on complex networks, including optimal percolation, optimal sampling, optimal navigation, and optimal seeding. The research will address the practical, algorithmic and theoretical aspects of the OPs, focusing on the generalization of the problem settings to realistic scenarios, the development of numerical techniques for the solution of the OPs, and the establishment of analytical baselines for the objective assessment of the performance of the optimization algorithms.

The total budget of the award is 450,000 USD, the project’s duration is three years.