On the set partitioning type formulation for the discrete location problem (Q1088881)

An approach to the discrete location problem is presented. The formulation is based on the set partitioning problem with the emphasis being placed on the weighted objective function and the importance of the ''value'' or ''attractiveness'' of the potential ''covers'', i.e. the number of centres served by a specific location. FORTRAN programs were written to generate the potential subsets of centres to be served, for a specific county in northern Greece, and a mathematical programming package (APEX III) was used in its integer programming mode to provide solutions for various sets of subsets of centres which were generated according to certain criteria.