Journal article
Coverage location problems and totally balanced relaxations: Simulation results
Location science, Vol.2(4), pp.241-257
12/1994
Abstract
Several types of covering location models are easily solved if the underlying covering matrix is totally balanced. If the covering matrix is not totally balanced, it may be desirable to identify a minimal number of rows or columns to remove so that the remaining matrix is totally balanced. Problem decomposition can take advantage of this information. In this paper, we give a heuristic algorithm to remove undesirable rows or columns. This algorithm is tested on both randomly generated matrices and matrices arising from planar location problems. A significant finding is that matrices from planar location problems seem to have more desirable structure (fewer removed rows or columns) than comparable random matrices.
Details
- Title: Subtitle
- Coverage location problems and totally balanced relaxations: Simulation results
- Creators
- Martin W. Broin - Division of Management, Texas A and M International University, United StatesTimothy J. Lowe - Department of Management Sciences, College of Business Administration, University of Iowa, United States
- Resource Type
- Journal article
- Publication Details
- Location science, Vol.2(4), pp.241-257
- ISSN
- 0966-8349
- Language
- English
- Date published
- 12/1994
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963199102771
Metrics
1 Record Views