Given a mobile network composed of a set of devices, a set of antennas (Base Stations) and a discrete set of radio resources, we define a domain as a subset of devices/antennas that communicate via radio transmission links in order to exchange data for a specific service. In this context, we are interested in the Domain Creation (DC) problem. It consists in finding an allocation of radio resources to the transmission links of the network so that different domains, each one related to a specific service (gaming, video streaming, content sharing, etc.), can be implemented simultaneously. Every domain has specific requirements in terms of quality of the transmission links (SINR) and hardware resources dedicated to carrying out the corresponding service. We give an integer linear programming formulation for the problem and propose two classes of valid inequalities to strengthen its linear relaxation. The resulting formulation is used within a branch-and-cut algorithm for the problem. We further propose an efficient heuristic obtained from solving the routing and resource assignment sub-problems separately. We assess the efficiency of our approaches through some experiments on instances of varying size and realistic input data from Orange mobile network.