We consider the problem of selecting bases for firefighting activities (e.g., vigilance, water refill, initial attack) and links between them in the context of wildfire promptness. Bases can be facilities, such as watchtowers and water tanks, or positions from where an initial attack is conducted. It is assumed that it is advantageous to connect bases in such a way that resources (e.g. ground crews) can quickly move between them. The general problem is modelled in a general way as integration of a set covering problem (for selecting the location of the bases) and a travelling salesman problem where the cities are the selected locations and the arcs the links that connect them. We propose a mixed integer programming model where objectives are addressed by lexicographic optimization. The first objective is related to cover potential ignition points with a high estimate of their initial spread rate of the fire at the detection time. Computational experiments are discussed for a scenario, of an actual landscape, with parameters estimated from a fire behaviour model that takes into account slope, fuels, and wind.