Geoscience Reference
In-Depth Information
Guignard M, Opaswongkarn K (1990) Lagrangean dual ascent algorithms for computing bounds
in capacitated location problems. Eur J Oper Res 46:73-83
Guignard M, Spielberg K (1977) Algorithms for exploiting the structure of the simple plant
location problem. Ann Discret Math 1:247-271
Hamacher HW, Labbé M, Nickel S, Sonneborn T (2004) Adapting polyhedral properties from
facility to hub location problems. Discret Appl Math 145:104-116
Hindi KS, Pienkosz K (1999) Efficient solution of large scale, single-source, capacitated plant
location problem. J Oper Res Soc 50:268-274
Holmberg K, Rönnqvist M, Yuan D (1999) An exact algorithm for the capacitated facility location
problems with single sourcing. Eur J Oper Res 113:554-559
Jacobsen SK (1983) Heuristics for the capacitated plant location model. Eur J Oper Res 12:253-
261
Janacek J, Buzna L (2008) An acceleration of Erlenkotter-Körkel's algorithms for the uncapaci-
tated facility location problem. Ann Oper Res 164:97-109
Jiaa H, Ordoñez F, Dessouky M (2007) A modeling framework for facility location of medical
services for large-scale emergencies. IIE T 39:41-55
Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location
problem. Manag Sci 18:718-731
Klincewicz JG, Luss H (1986) A Lagrangean relaxation heuristic for the capacitated facility
location with single-source constraints. J Oper Res Soc 37:495-500
Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res
162:4-29
Klose A, Görtz S (2007) A branch-and-price algorithm for the capacitated facility location
problem. Eur J Oper Res 179:1109-1125
Körkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper
Res 39:157-173
Krarup J, Pruzan PM (1983) The simple plant location problem: survey and synthesis. Eur J Oper
Res 12:36-81
Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manag Sci 9:645-
666
Labbé M, Peeters D, Thisse JF (1995) Location on networks. In: Ball MO, Magnanti TL, Monma
CL, Nemhauser GL (eds) Network routing, handbooks in operations research and management
science, vol 8. North-Holland, Amsterdam, pp 551-624
Letchford AN, Miller SJ (2012) Fast bounding procedures for large instances of the simple plant
location problem. Comput Oper Res 39:985-990
Letchford AN, Miller SJ (2014) An aggressive reduction scheme for the simple plant location
problem. Eur J Oper Res 234:674-682
Leung J, Magnanti TL (1989) Valid inequalities and facets of the capacitated plant location
problem. Math Program 44:271-291
Lin CKY (2009) Stochastic single-source capacitated facility location model with service level
requirements. Int J Prod Econ 117:439-451
Louveaux FV, Peeters D (1992) A dual-based procedure for stochastic facility location. Oper Res
40:564-573
Magnanti TL, Wong RT (1990) Decomposition methods for facility location problems. In:
Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley-Interscience, New York
Manne AS (1964) Plant location under economies-of-scale - decentralization and computations.
Manag Sci 11:213-235
Marín A (2011) The discrete facility location problem with balanced allocation of customers. Eur
J Oper Res 210:27-38
Melkote S, Daskin MS (2001) Capacitated facility location/network design problems. Eur J Oper
Res 129:481-495
Melo T, Nickel S, Saldanha da Gama F (2009) Facility location and supply chain management: a
review. Eur J Oper Res 196:401-412
