References
- Balinski, M.L. and P. Wolfe, 'On Benders Decomposition and a Plant Location Problem,' Working paper ARO-27, Mathematica, Inc., Princeton, New Jersey, 1963
- Barcelo, J. and J. Casanovas, 'A Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem,' European Journal of Operational Research, Vol.15(1984), pp. 212-226 https://doi.org/10.1016/0377-2217(84)90211-X
- Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, 'Branchand- price:Column Generation for Solving Huge Integer Programs,' Operations Research, Vol.46(1998), pp.316-329 https://doi.org/10.1287/opre.46.3.316
- Cho, G., 'A Pseudopolynomial-time Algorithm for Solving a Capacitated Subtree of a Tree Problem in a Telecommunication System,' Journal of the Korean Institute of Industrial Engineers, Vol.22, No.3(1996), pp.485-498
- Cho, G., 'An Efficient Algorithm for an Uncapacitated Facility Location Problem on a Tree Structured Network,' DAEHAN Journal of Business, Vol.18(1998), pp.97-109
- Conn, A.R. and G. Cornuejols, 'A Projection Method for the Uncapacitated Facility Location Problem,' CS-87-19, Computer Science Department, University of Waterloo, 1987
- Cornuejols, G. and J.M. Thizy, 'Some Facets of the Simple Plant Location Polytope,' Mathematical Programming, Vol. 23(1982), pp. 50-74 https://doi.org/10.1007/BF01583779
- Graves, S.C. and S.P. Willems, 'Optimizing Strategic Safety Stock Placement in Supply Chains,' Manufacturing & Service Operations Management, Vol.2, No.1(2000), pp. 68-83 https://doi.org/10.1287/msom.2.1.68.23267
- Holmberg, K., M. Ronqvist, and D. Yuan, 'An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing,' European Journal of Operational Research, Vol.113(1999), pp.544-559 https://doi.org/10.1016/S0377-2217(98)00008-3
- Inderfurth, K., 'Safety Stock Optimisation in Multi Stage Inventory Systems,' International Journal of Production Economics, Vol.24(1991), pp.103-113
- Klincewicz, J. and H. Luss, 'A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-source Constraints,' Journal of Operational Research Society, Vol.37(1986), pp.495-500 https://doi.org/10.2307/2582672
- Magnanti, T.L. and R.T. Wong, 'Accelerated Benders Decomposition:Algorithmic Enhancement and Model Selection Criteria,' Operations Research, Vol.29(1981), pp.464- 484 https://doi.org/10.1287/opre.29.3.464
- Mirchandani, P.B. and R.L. Francis, Discrete Location Theory, John Wiley and Sons, Inc. New York, U.S.A, 1990
- Pirkul, H., 'Efficient Algorithm for the Capacitated Concentrator Location Problem,' Computers and Operations Research, Vol. 14(1987), pp.197-208 https://doi.org/10.1016/0305-0548(87)90022-0
- Savelsbergh, M., 'A Branch-and-Price Algorithm for the Generalized Assignment Problem,' Operations Research, Vol.45(1997), pp.831-841 https://doi.org/10.1287/opre.45.6.831
- Shaw, D.X., 'Reformulation and Column Generation for Several Telecommunication Network Design Problems, Technical Report, School of Industrial Engineering, Purdue University, West Lafayette, IN47907, U.S.A., 1993
- Shen, Z.M., C. Coullard, and M.S. Daskin, 'A Joint Location-inventory Model,' to appear in Transportation Science, 2001
- Simpson, K.F., 'In-process Inventories,' Operations Research, Vol.6(1958), pp.863- 873 https://doi.org/10.1287/opre.6.6.863
- Sridharan, R., 'A Lagrangian Heuristic for the Capacitated Plant Location Problem with Single Source Constraints,' European Journal of Operational Research, Vol.66 (1993), pp.305-312 https://doi.org/10.1016/0377-2217(93)90219-D