In mobile access networks, base station (BS) assignment mecbanisms are mainly driven by radio conditions since it is generally assumed tbat tbe limiting factor is tbe air interface. Tbis assumption bas been proven to be very reasonable wben circuit voice was tbe dominant service and backbaul capacity provisioning accounting for tbe peak rate at tbe BSs was an economically feasible option. However, as more efficient air interface tecbnologies are introduced along witb bigber data rate services, a growing concern is tbat tbe transport part of tbe mobile network can also represent a bottleneck. In tbis paper we analyze a BS assignment strategy tbat simultaneously exploits load balancing in botb tbe radio interface and tbe transport backbaullinks. Tbe BS assignment problem is solved by means of Simulated Annealing beuristics under different deployment scenarios comprising partially-limited backbaul Radio Access Networks (RANs) and tbe presence of traffic botspots. Results acbieved for tbe proposed BS assignment strategy are compared to tbose obtained by common strategies sucb as minimum patb loss (MPL) and load balancing radio (LBR).