This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
: We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of clus...
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...