The maximum-capture hierarchical location problem

The maximum-capture hierarchical location problem

0.00 Avg rating0 Votes
Article ID: iaor1996746
Country: Netherlands
Volume: 62
Issue: 3
Start Page Number: 363
End Page Number: 371
Publication Date: Nov 1992
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: integer
Abstract:

In this paper we present a 0-1 integer programming model for locating services with a hierarchical structure when there is competition in the region of interest. The model utilizes a hierarchical covering formulation and it allows the location of new servers as well as the relocation of existing servers. Computational experience is provided.

Reviews

Required fields are marked *. Your email address will not be published.