Year-end Sale % OFF 
Abstract
In this paper, a branch and bound algorithm for the partial coverage capacitated facility locations problem is developed. We have to fix open a set of warehouses which are economically feasible. It is an extension of the algorithm given by B. M. Khumawala [10] and Sudha Arora and S.R. Arora [2]. The case when the demand of the customer may not be satisfied completely, giving rise to “opportunity demand” is also discussed. This is illustrated with the help of examples and their computational results.
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.
