×

zbMATH — the first resource for mathematics

Heuristics for the capacitated plant location model. (English) Zbl 0514.90018

MSC:
90B05 Inventory, storage, reservoirs
65K05 Numerical mathematical programming methods
90C11 Mixed integer programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Akinc, U.; Khumawala, B.M., An efficient branch and bound algorithm for the capacitated warehouse location problem, Management sci., 23, 6, 585-594, (1977) · Zbl 0348.90157
[2] Beasley, J.E.; Christofides, N., An algorithm for the capacitated warehouse location problem, European J. operational res., 12, 1, 19-28, (1983) · Zbl 0499.90027
[3] Bilde, O.; Krarup, J., Sharp lower bounds and efficient algorithms for the simple plant location problem, Ann. discrete math., 1, 79-97, (1977)
[4] Cooper, L., Heuristic methods for location-allocation problems, SIAM rev., 6, 1, 37-53, (1964) · Zbl 0956.90014
[5] Cornuéjols, G.; Fisher, M.L.; Nemhauser, G.L., Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms, Management sci., 23, 8, 789-810, (1977) · Zbl 0361.90034
[6] Davis, P.S.; Ray, T.L., A branch-bound algorithm for the capacitated facilities location problem, Naval res. logist. quart., 16, 3, 331-334, (1969) · Zbl 0186.24905
[7] Ellwein, L.B.; Gray, P., Solving fixed charge location-allocation problems with capacity and configuration constraints, AIIE trans., 3, 4, 290-298, (1971)
[8] Erlenkotter, D., A dual-based procedure for uncapacitated facility location, Operation res., 26, 6, 992-1009, (1978) · Zbl 0422.90053
[9] Feldman, E.; Lehrer, F.A.; Ray, T.L., Warehouse location under continuous economies of scale, Management sci., 12, 9, 670-684, (1966)
[10] Geoffrion, A.M.; McBride, R., Lagrangean relaxation applied to capacitated facility location problems, AIIE trans., 10, 1, (1978)
[11] Glover, F.; Klingman, D.; Stutz, J., Augmented threaded index method for network optimization, Infor, 12, 3, 293-298, (1974) · Zbl 0288.90077
[12] Guignard, M.; Spielberg, K., A direct dual method for the mixed plant location problem with some side constraints, Math. programming, 17, 198-228, (1979) · Zbl 0416.90052
[13] Jacobsen, S.K., A unified approach to heuristics and algorithms for a class of uncapacitated plant location problems, Working paper, IMSOR, DTH, (1977)
[14] Jacobsen, S.K., On the use of tree indexing methods in transportation algorithms, European J. operational res., 2, 1, 54-65, (1978) · Zbl 0381.90095
[15] Khumawala, B.M., An efficient heuristic procedure for the uncapacitated warehouse location problem, Naval res. logist. quart., 20, 109-121, (1973)
[16] Khumawala, B.M., An efficient heuristic procedure for the capacitated warehouse location problem, Naval res. logist. quart., 21, 4, 609-623, (1974) · Zbl 0295.90030
[17] Kuehn, A.A.; Hamburger, M.J., A heuristic program for locating warehouses, Management sci., 9, 4, 643-666, (1963)
[18] Manne, A.S., Plant location under economies of scale, Management sci., 11, 2, 213-235, (1964)
[19] Nauss, R.M., An improved algorithm for the capacitated facility location problem, J. operational res. soc., 29, 23, 1195-1201, (1978) · Zbl 0402.90063
[20] Rapp, Y., Planning of exchange locations and boundaries, Ericsson technics, 2, 1-22, (1962)
[21] Sá, G., Branch-and-bound and approximate solutions to the capacitated plant-location problem, Operations res., 17, 1005-1016, (1969)
[22] Teitz, M.B.; Bart, P., Heuristic methods for estimating the generalized vertex Median of a weighted graph, Operations res., 16, 5, 955-961, (1968) · Zbl 0165.22804
[23] Van Roy, T.J., A cross decomposition algorithm for capacitated facility location, () · Zbl 0594.90022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.