In our implementation the elements of the starting multiplier vector were set to u_i^0=〖min〗_(j∈pi) w_i,i∈M, where p_i is the collection of neighborhoods covering point i, and the upper bound ƒ_UB was found by means of the Greedy-SC algorithm described below. Moreover,