Integers in the location set-covering problem

Pastor's discovery of a historical example of a noninferior fractional solution to the location set-covering problem is not unexpected. We argue here that a method or observation that is generally good (or true) has merit and should not be dismissed as lacking in utility because of occasional counterexamples. A further report concerning fractions/integers in set- covering problems is made and the specific example cited by Pastor is analyzed.