Key points are not available for this paper at this time.
We explore the potential of optimizing resource allocation with flexible numerology in frequency domain and variable frame structure in time domain, with services of with different types of requirements. We prove the NP-hardness of the problem and propose a scalable optimization algorithm based on linear programming and Lagrangian duality. Numerical results show significant advantages of adopting flexibility in both time and frequency domains for capacity enhancement and meeting the requirements of mission critical services.
You et al. (Mon,) studied this question.