The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

OF THESIS Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science Computer Science The University of New Mexico Albuquerque, New Mexico

In this paper a special complex Kn of abstract cubes [2, 3], which contains only n-dimensional cubes is examined. The border of this complex is an abstract (n − 1)-dimensional sphere. It is proved that the abstract sphere contains at least one 0dimensional cube, which belongs to exactly n cubes with dimension 1, if the complex is a homogeneous n-dimensional tree. This result allows to solve, in...

The p-median problem has been widely studied in the literature during the last decades especially its linear version. We propose a capacitated p-median problem with concave costs, in which the global cost incurred for each established facility is a concave function of the quantity q delivered by this facility. The unit distribution cost decreases with the increased quantity of output or demand ...

This paper is concerned with the problem of locating II new facilities in the median space when there are k facilities already located. The objective is to minimize the weighted sum of distances. Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems. The complexit...