Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems

References

• Al-Loughani I. Algorithmic approaches for solving the Euclidean distance location and location-allocation problems. (1997) (Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA) . Ph.D. dissertationGoogle Scholar
• Avriel M. A geometric programming approach to the solution of locational problems. J. Regional Sci. (1980) 20:239–246Crossref, Google Scholar
• Bazaraa M. S., Jarvis J. J., Sherali H. D.Linear Programming and Network Flows (1990) 2nd ed.(John Wiley and Sons, Inc., New York) Google Scholar
• Bongartz I., Calamai P. H., Conn A. R. A projection method for Lp norm location-allocation problems. Math. Programming (1994) 66:283–312Crossref, Google Scholar
• Brimberg J., Love R. F. Global convergence of a generalized iterative procedure for the minisum location problem with lp distances. Oper. Res. (1993) 41(6):1153–1163Link, Google Scholar
• Brimberg J., Love R. F. Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming. Oper. Res. (1998) 46(5):702–709Link, Google Scholar
• Brimberg J., Chen R., Chen D. Accelerating convergence in the Fermat-Weber location problem. Oper. Res. Lett. (1998) 22:151–157Crossref, Google Scholar
• Calamai P. H., Conn A. R. A projected Newton method for lp norm location problems. Math. Programming (1987) 38:75–109Crossref, Google Scholar
• Cavalier T. M., Sherali H. D. Euclidean distance location-allocation problems with uniform demands over convex polygons. Transp. Sci. (1986) 20:107–116Link, Google Scholar
• Chen P., Hansen P., Jaumard B., Tuy H. Solution of the multisource Weber and conditional Weber problems by D.-C. programming. Oper. Res. (1998) 46(4):548–562Link, Google Scholar
• Cooper L. The transportation-location problem. Oper. Res. (1972) 20(1):94–108Link, Google Scholar
• Eyster J. W., White J. A., Wierwille W. W. On solving multifacility location problems using a hyperbolic approximation procedure. AIIE Trans. (1973) 5:1–6Crossref, Google Scholar
• Francis R. L., McGinnis L. F., White J. A.Facility Layout and Location: An Analytical Approach (1991) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Geoffrion A. M. Integer programming by implicit enumeration and Balas' method. SIAM Rev. (1967) 9:178–190Crossref, Google Scholar
• Hansen P., Mladenovic N., Taillard E. Heuristic solution of the multisource Weber problem as a p-median problem. Oper. Res. Lett. (1998) 22:55–62Crossref, Google Scholar
• Horst R., Tuy H.Global Optimization: Deterministic Approaches (1993) 2nd ed.(Springer-Verlag, Berlin) Crossref, Google Scholar
• Love R. F., Juel H. Properties and solution methods for large location-allocation problems. J. Oper. Res. Soc. (1982) 33(5):443–452Google Scholar
• Manber U.Introduction to Algorithms: A Creative Approach (1989) (Addison-Wesley Publishing, Reading, MA) Google Scholar
• Murtagh B. A., Niwattisyawong S. R. An efficient method for the multi-depot location-allocation problem. J. Oper. Res. Soc. (1982) 33(7):629–634Google Scholar
• Selim S. S. Biconvex programming and deterministic and stochastic location allocation problems. (1979) (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA) . Ph.D. dissertationGoogle Scholar
• Sherali H. D., Al-Loughani I. Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods. Comput. Optimiz. and Appl. (1999) 14:275–291Crossref, Google Scholar
• Sherali H. D., Nordai F. L. NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands. Math. Oper. Res. (1988) 13(1):32–49Link, Google Scholar
• Sherali H. D. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optimiz. (1992b) 2:101–112Crossref, Google Scholar
• Sherali H. D., Ramachandran S., Kim S. A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem. Discrete Appl. Math. (1994) 49(1–3):357–378Crossref, Google Scholar
• Wendell R. E., Hurter A. P. Location theory, dominance and convexity. Oper. Res. (1973) 21(31):314–320Link, Google Scholar