set C; #set of districts
set D in C cross C; #set of connections
param t{D}; #time of using given connection
var x{C}, binary; #Is Fire Station in the node?
minimize z: sum{i in C} x[i]; #want to find minimal amount of FS to reach all nodes
#time constraint: travel time to any district cant exceed 20min