Let ( P = p_1, p_2, \dots, p_n ) be a set of demand points in a metric space ( (X, d) ), where ( d ) is a distance metric (e.g., Euclidean, Manhattan, or shortest-path on a network). We wish to select a set ( C = c_1, c_2, \dots, c_m ) of ( m ) centre locations (not necessarily from ( P )).
Do you need data (like absorption spectra) or theoretical models?
Let ( P = p_1, p_2, \dots, p_n ) be a set of demand points in a metric space ( (X, d) ), where ( d ) is a distance metric (e.g., Euclidean, Manhattan, or shortest-path on a network). We wish to select a set ( C = c_1, c_2, \dots, c_m ) of ( m ) centre locations (not necessarily from ( P )).
Do you need data (like absorption spectra) or theoretical models?