Welch, S.B. and Salhi, S. and Drezner, Z. (2006) The Multifacility Maximin Planer Location Problem with Facility Interaction. IMA Journal of Management Mathematics, 17 . pp. 397-412.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Two branch-and-bound algorithms are proposed to optimally solve the maximin formulation for locating p facilities in the plane. Tight upper and lower bounds are constructed and suitable methods of guiding the search developed. To enhance the method, efficient measures for identifying specific squares for subdivision are suggested. The proposed algorithms are evaluated on a set of randomly generated problems of up to five facilities and 120 nodes.
|Uncontrolled keywords:||location; continuous space; branch and bound|
|Subjects:||H Social Sciences|
|Divisions:||Faculties > Social Sciences > Kent Business School > Management Science|
|Depositing User:||Said Salhi|
|Date Deposited:||17 Sep 2008 12:52|
|Last Modified:||14 Jan 2010 14:20|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/5279 (The current URI for this page, for reference purposes)|
- Depositors only (login required):