Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

References

• Ahn S., Cooper C., Cornuéjols G., Frieze A. M. Probabilistic analysis of a relaxation for the p-median problem. Math. Oper. Res. (1988) 13:1–31Link, Google Scholar
• Balinski M. Integer programming: methods, uses, computation. Management Sci. (1965) 12:253–313Link, Google Scholar
• Barahona F., Chudak F., Pardalos P. Solving large scale uncapacitated facility-location problems. Approximation and Complexity in Numerical Optimization (2000) (Kluwer Academic Publishers, Norwell, MA) 48–62Crossref, Google Scholar
• Beasley J. E. Lagrangean heuristics for location problems. Eur. J. Oper. Res. (1993) 65:383–399Crossref, Google Scholar
• Bilde O., Krarup J. Sharp lower bounds and efficient algorithms for the simple plant-location problem. Ann. Discrete Math. (1977) 3:79–97Crossref, Google Scholar
• Brimberg J., ReVelle C. A bi-objective plant-location problem: Cost vs. demand served. Location Sci. (1998) 6:121–135Crossref, Google Scholar
• Brimberg J., ReVelle C. The maximum return-on-investment plant-location problem. J. Oper. Res. Soc. (2000) 51:729–735Crossref, Google Scholar
• Conn A. R., Cornuéjols G. A projection method for the uncapacitated facility-location problem. Math. Programming (1990) 46:273–298Crossref, Google Scholar
• Cornuéjols G., Fisher M. L., Nemhauser G. L. Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms. Management Sci. (1977) 23:163–177Link, Google Scholar
• Cornuéjols G., Nemhauser G. L., Wolsey L. A., Mirchandani P. B., Francis R. L. The uncapacitated facility-location problem. Discrete Location Theory (1990) (John Wiley, New York) 119–171Google Scholar
• Daskin M.Network and Discrete Location: Models, Algorithms and Applications (1995) (John Wiley, New York) Crossref, Google Scholar
• Efroymson M. A., Ray T. L. A branch-and-bound algorithm for plant-location. Oper. Res. (1996) 14:361–368Link, Google Scholar
• Erlenkotter D. A dual-based procedure for uncapacitated facility location. Oper. Res. (1978) 26:992–1009Link, Google Scholar
• Feldman E., Lehrer F. A., Ray T. L. Warehouse location under continuous economies of scale. Management Sci. (1966) 12:670–684Link, Google Scholar
• Francis R., McGinnis L. F., White J. A.Facility Layout and Location: An Analytical Approach (1992) 2nd ed.(Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Galvão R. D., Raggi L. A. A method for solving to optimality uncapacitated location problems. Ann. Oper. Res. (1989) 18:225–244Crossref, Google Scholar
• Ghosh D. Neighborhood search heuristics for the uncapacitated facility-location problem. Eur. J. Oper. Res. (2003) 150:150–162Crossref, Google Scholar
• Goldengorin B., Ghosh D., Sierksma G. Branch and peg algorithms for the simple plant-location problem. Comput. Oper. Res. (2003a) 30:967–981Crossref, Google Scholar
• Goldengorin B., Tijssen G. A., Ghosh D., Sierksma G. Solving the simple plant location problem using data correcting approach. J. Global Optim. (2003b) 25:377–406Crossref, Google Scholar
• Goncharov E., Kochetov Y. Behavior of the probabilistic greedy algorithms for the multistage uncapacitated facility-location problem. Discrete Anal. Oper. Res. (1999) 6:12–32(in Russian)Google Scholar
• Goncharov E., Kochetov Y. Probabilistic tabu search algorithm for the multi-stage uncapacitated facility-location problem. Oper. Res. Proc. (2000) (Springer, Berlin, Germany) 65–70Google Scholar
• Hammer P. L. Plant-location—pseudo-boolean approach. Israel J. Tech. (1968) 6:330–332Google Scholar
• Hansen P., Mladenović N. Variable neighborhood search for the p-median. Location Sci. (1997) 5:207–226Crossref, Google Scholar
• Hansen P., Mladenović N. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. (2001) 130:449–467Crossref, Google Scholar
• Hansen P., Mladenović N., Glover F., Kochenberger G. Variable neighborhood search. Handbook of Metaheuristics (2003) (Kluwer Academic Publishers, Boston, MA) 145–184Crossref, Google Scholar
• Hansen P., Mladenović N., Perez-Brito D. Variable neighborhood decomposition search. J. Heuristics (2001) 7:335–350Crossref, Google Scholar
• Jones P., Lowe T. J., Muller G., Xu N., Ye Y., Zydiak J. L. Specially structured uncapacitated facility-location problems. Oper. Res. (1995) 43:661–669Link, Google Scholar
• Karkazis J. Principal direction search: A new method of search for unconstrained LP formulations. Eur. J. Oper. Res. (1985) 20:352–362Crossref, Google Scholar
• Khumawala B. M. An efficient branch and bound algorithm for the warehouse location problem. Management Sci. (1972) 18:718–731Link, Google Scholar
• Klose A., Derigs U., Bachem A., Drexl A. A comparison between the Erlenkotter algorithm and a branch and bound algorithm based on subgradient optimization to solve the uncapacitated facility-location problem. Operations Research Proceedings 1994 (1995) (Springer, Berlin, Germany) 335–339Crossref, Google Scholar
• Körkel M. On the exact solution of large-scale simple plant-location problem. Eur. J. Oper. Res. (1989) 39:157–173Crossref, Google Scholar
• Krarup J., Pruzan P. M. Simple plant location problem: Survey and synthesis. Eur. J. Oper. Res. (1983) 12:36–81Crossref, Google Scholar
• Kratica J., Tosic D., Filipovic V., Ljubic I. Solving the simple plant-location problem by genetic algorithms. RAIRO—Oper. Res. (2001) 35:127–142Crossref, Google Scholar
• Kuehn A. A., Hamburger M. J. A heuristic program for locating warehouses. Management Sci. (1963) 9:643–666Link, Google Scholar
• Labbé M., Louveaux F. V., Dell'Amico N., Maffioli F., Martello S. Location problem. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley, New York) 264–271Google Scholar
• Labbé M., Peeters D., Thisse J. F., Ball M., Magnanti T., Monma C., Nemhauser G. Location on networks. Handbook of Operations Research and Management Science: Networks (1995) (North-Holland, Amsterdam, The Netherlands) 551–624Google Scholar
• Manne A. S. Plant-location under economies-of-scale: Decentralization and computation. Management Sci. (1964) 11:213–235Link, Google Scholar
• Marsten R. E., Hogan W. W., Blankenship J. W. The boxstep method for large-scale optimization. Oper. Res. (1975) 23:389–405Link, Google Scholar
• Michel L., Van Hentenryck P. A simple tabu search for warehouse location. Eur. J. Oper. Res. (2004) 157:576–591Crossref, Google Scholar
• Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (Wiley-Interscience, New York) Google Scholar
• Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24:1097–1100Crossref, Google Scholar
• Mladenović N., Brimberg J., Hansen P. A note on duality gap in the simple plant-location problem. Eur. J. Oper. Res. (2006) 174:11–22Crossref, Google Scholar
• Morris J. G. On the extent to which certain fixed charge depot location problems can be solved by LP. J. Oper. Res. Soc. (1978) 29:71–76Crossref, Google Scholar
• Myung V. S., Kim H., Tcha D. A bi-objective uncapacitated facility-location problem. Eur. J. Oper. Res. (1997) 100:608–616Crossref, Google Scholar
• Pentico D. W. The assortment problem with nonlinear cost functions. Oper. Res. (1976) 24:1129–1142Link, Google Scholar
• Pentico D. W. The discrete two-dimensional assortment problem. Oper. Res. (1988) 36:324–332Link, Google Scholar
• ReVelle C. Facility siting and integer friendly programming. Eur. J. Oper. Res. (1993) 65:147–158Crossref, Google Scholar
• ReVelle C., Laporte G. The plant-location problem: New models and research prospects. Oper. Res. (1996) 44:864–874Link, Google Scholar
• Spielberg K. Algorithms for the simple plant-location problem with some side conditions. Oper. Res. (1969) 17:85–111Link, Google Scholar
• Stollsteimer J. F. A working model for plant numbers and locations. J. Farm. Econom. (1963) 45:631–645Crossref, Google Scholar
• Teitz M. B., Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. (1968) 16:955–961Link, Google Scholar
• Tripathy A., Süral H., Gerchak Y. Multidimensional assortment problem with an application. Networks (1999) 33:239–245Crossref, Google Scholar
• Voss S. A reverse elimination approach for the p-median problem. Stud. Locational Anal. (1996) 8:45–58Google Scholar
• Weber A.Ueber den Standort der Industrien (1909) (Mohr, Tübingen) . (English Translation: C. I. Friedrich, translator. 1929. Theory of the Location of Industries. University of Chicago Press, Chicago, IL)Google Scholar
• Whitaker R. A fast algorithm for the greedy-interchange for large-scale clustering and median location problems. INFOR (1983) 21:95–108Google Scholar