Table 3.

Notation of model variables.

${\mathit{X}}_{\mathit{u}},{\mathit{Y}}_{\mathit{u}}$	Geographic coordinates of users (Lat., Long.)
$X_d,Y_d$	Geographic coordinates of UDAP (Lat., Long.)
$X_{eb},Y_{eb}$	Geographic coordinates of base stations (Lat., Long.)
$X_c,Y_c$	Head office geographic coordinates (Lat., Long.)
N	Number of users
M	Number of UDAP
K	Number of base stations
P	Number of base stations
$X_T,Y_T$	Geographic coordinates of all nodes (Lat., Long.)
D	Distance between nodes
G	Logical matrix of links between nodes
$D_{max}$	Range in kilometers of the devices
A	Compressed matrix of G
$rp$	Row indicator of the compressed matrix
$ci$	Column index of the compressed matrix
$ai$	Compressed array value index
$pred$	Path predecessor tree function, Dijkstra
$nodo$	Device Index
$path$	Tree Path Set
$CostR$	Cost of each route
$Cost$	Cumulative vector of costs per route
$CostT$	Tree Path Adder
$CapNodo$	Maximum capacity of each node
$Coverage$	Maximum distance in kilometers of reach of the nodes
B	Logical matrix of connections between users and UDAP
$tmp$	Time vector of users connected to concentrators, Prim
s	User count per UDAP
L	Matrix of users connected to each UDAP
$ind$	Matrix of users not connected to UDAP
$solC$	Resulting transposed logic matrix, Greedy SCP
$solL$	Optimal UDAP matrix, Greedy SCP
R	SolL ordered array without repeating UDAP
$X_{el},Y_{el}$	Geographical coordinates of optimal concentrators (Lat., Long.)
$G2$	Matrix of weights per link between nodes