Fractions in the location set-covering problem
Inferior and noninferior solutions to the location set-covering problem are differentiated and computational experience is presented which strongly suggests that noninferior solutions, from the relaxed linear programming formulation, will be fully integral with a high degree of reliability. The authors have not yet encountered a noninferior fractional solution. An explanation of this phenomenon is presented.
Year of publication: |
1992
|
---|---|
Authors: | Rosing, K E ; ReVelle, C S ; Rosing-Vogelaar, H |
Published in: |
Environment and Planning B: Planning and Design. - Pion Ltd, London, ISSN 1472-3417. - Vol. 19.1992, 2, p. 125-130
|
Publisher: |
Pion Ltd, London |
Saved in:
Saved in favorites
Similar items by person
-
Integers in the location set-covering problem
Rosing, K E, (1993)
-
Rosing, K E, (1986)
-
Market capture models under various customer-choice rules
Serra, D, (1999)
- More ...