Abstract
In this paper, a branch and bound algorithm for a special class of warehouse location problems when the objective function is fractional, is developed. The branching decision rules help us to decide which warehouse has to be opened or closed from any node of branching tree. We propose the revised version of the algorithm suggested by Basheer M. Khumawala (1972). It is illustrated with the help of a numerical example.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Basheer M. Khumawala, (1972), “An efficient branch and bound algorithm for the warehouse location problem”, Management Science, 18 B718–B731.
Kurt Spiel Berg, (1969), “Algorithms for the simple plant location problem with some side conditions”, Operations Research, Vol. 17, pp.85–111.
Efforaymson MA and Ray T.L., (1966), “A branch — bound algorithm for plant location”, Operation Research Vol. 14, pp.361–368.
Manne A.S., (1964), “Plant location under economics of scale-Decentralization and computations”, Management Science, Vol. 11, pp.213–235.
Feldman E., Lehrer F.A. and Ray T.L., (1966), “Warehouse locations under continuous economics of scale”, Managment Science, Vol. 12, pp.670–684.
SĀ. G, (1969), “Branch and Bound and Approximation solution to the capacitated plant location problem”, Operations Research, Vol.17, pp.1005–1015.
Kaj Holmberg, (1999), “Exact solution methods for uncapautated location problem with convex transportation costs” European Journal of Operational Research, 114, pp. 127–140.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Arora, S., Arora, S.R. Branch and Bound Algorithm for the Warehouse Location Problem with the Objective Function as Linear Fractional. OPSEARCH 43, 18–30 (2006). https://doi.org/10.1007/BF03398757
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398757