Journal article
An improved lower bound for the multimedian location problem
Annals of operations research, Vol.110(1-4), pp.17-31
02/01/2002
DOI: 10.1023/A:1020755231275
Abstract
We consider the problem of locating, on a network, n new facilities that interact with m existing facilities. In addition, pairs of new facilities interact. This problem, the multimedian location problem on a network, is known to be NP-hard. We give a new integer programming formulation of this problem, and show that its linear programming relaxation provides a lower bound that is superior to the bound provided by a previously published formulation. We also report results of computational testing with both formulations.
Details
- Title: Subtitle
- An improved lower bound for the multimedian location problem
- Creators
- Ranganath Nuggehalli - United Parcel ServiceTimothy J. Lowe - University of IowaJames E. Ward - Purdue University West Lafayette
- Resource Type
- Journal article
- Publication Details
- Annals of operations research, Vol.110(1-4), pp.17-31
- DOI
- 10.1023/A:1020755231275
- ISSN
- 0254-5330
- eISSN
- 1572-9338
- Number of pages
- 15
- Grant note
- National Science Foundation (http://data.elsevier.com/vocabulary/SciValFunders/100000001)
- Language
- English
- Date published
- 02/01/2002
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963114102771
Metrics
1 Record Views