Welch, S.B, Salhi, Said, Drezner, Zvi (2006) The Multifacility Maximin Planer Location Problem with Facility Interaction. IMA Journal of Management Mathematics, 17 . pp. 397-412. (doi:10.1093/imaman/dpl008) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:5279)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: http://dx.doi.org/10.1093/imaman/dpl008 |
Abstract
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.
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1093/imaman/dpl008 |
| Uncontrolled keywords: | location; continuous space; branch and bound |
| Subjects: | H Social Sciences |
| Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
| Depositing User: | Said Salhi |
| Date Deposited: | 17 Sep 2008 12:52 UTC |
| Last Modified: | 05 Nov 2024 09:37 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/5279 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Salhi, Said.
| Creator's ORCID: |
 https://orcid.org/0000-0002-3384-5240
|
|---|---|
| CReDIT Contributor Roles: |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
