Recursos na Borda: Otimização para o Open RAN usando Programação Inteira e Algoritmos Genéticos

This paper addresses the joint challenge of user admission and association, as well as the optimized placement of functional units in Open RAN architectures with network slicing support. An optimization model is formulated as an Integer Linear Programming problem, which incorporates Quality of Service constraints and computational resource limitations. The model's scalability is assessed through techniques that combine exact solution methods with approximate heuristics. Simulation results demonstrate not only the feasibility and computational efficiency of the proposed solutions but also their scalability, robustness, and practical applicability in large-scale scenarios, achieving an effective balance between solution quality and computational cost.