Abstract
Inferior and noninferior solutions to the location set-covering problem arc 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
