Geoscience Reference
In-Depth Information
Delmaire H, Díaz JA, Fernández E, Ortega M (1999b) Comparing new heuristics for the pure
integer capacitated plant location problem. Investig Oper 8:217-242
Delmaire H, Díaz JA, Fernández E, Ortega M (1999a) Reactive GRASP and tabu search based
heuristics for the single source capacitated plant location problem. Inform Syst Oper Res
(INFOR) 37:194-225
Díaz JA, Fernández E (2002) A branch and price algorithm for the single source capacitated plant
location problem. J Oper Res Soc 53:728-748
Drezner Z, Hamacher HW (eds) (2002) Facility location: applications and theory. Springer,
New York
Efroymson MA, Ray TL (1966) A branch and bound algorithm for plant location. Oper Res
14:361-368
Elloumi S, Labbé M, Pochet Y (2004) A new formulation and resolution method for the p-center
problem. INFORMS J Comput 16:84-94
Ellwein LB, Gray P (1971) Solving fixed charge location-allocation problems with capacity and
configuration constraints. AIIE T 3:290-299
Erkenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992-
1009
Escudero LF, Landete M, Marín A (2009) A branch-and-cut algorithm for the winner determination
problem. Decis Support Syst 46:649-659
Fernández E, Puerto J (2003) Multiobjective solution of the uncapacitated plant location problem.
Eur J Oper Res 145:509-529
Filho VJMF, Galvão RD (1998) A tabu search heuristic for the concentrator location problem.
Locat Sci 6:189-209
Fisher ML, Nemhauser GL, Wolsey LA (1978) An analysis of approximations for maximizing
submodular set functions -II. Math Program Stud 8:73-87
Fisher ML, Jaikumar R, Van Wassenhove LN (1986) A multiplier adjustment method for the
generalized assignment problem. Manag Sci 32:1095-1103
Frieze AM (1974) A cost function property for plant location problems. Math Program 7:245-248
Gao Y (2012) Uncertain models for single facility location problems on networks. Appl Math
Model 36:2592-2599
Garey MR, Johnson DS (1979) Computers and intractabiliy: a guide to the theory of NP-
completeness. Freeman, San Francisco
Gendron B, Semet F (2009) Formulations and relaxations for a multi-echelon capacitated location-
distribution problem. Comput Oper Res 36:1335-1355
Geoffrion AM, McBride R (1978) Lagrangean relaxation applied to capacitated facility location
problems. AIIE T 10:40-47
Ghiani G, Guerriero F, Musmanno R (2002) The capacitated plant location problem with multiple
facilities in the same site. Comput Oper Res 29:1903-1912
Ghiani G, Laganà, Manni E, Triki C (2012) Capacitated location of collection sites in an urban
waste management system. Waste Manag 32:1291-1296
Goldengorin B, Ghosh D, Sierksma G (2004) Branch and peg algorithms for the simple plant
location problem. Comput Oper Res 31:241-255
Gourdin É, Klopfenstein O (2008) Multi-period capacitated location with modular equipments.
Comput Oper Res 35:661-682
Gouveia LE, Saldanha da Gama F (2006) On the capacitated concentrator location problem: a
reformulation by discretization. Comput Oper Res 33:1242-1258
Guignard M (1980) Fractional vertices, cuts and facets of the simple plant location problem. Math
Program Stud 12:150-162
Guignard, M (1988) A Lagrangean dual ascent algorithm for simple plant location problems. Eur
J Oper Res 35:193-200
Guignard M, Kim S (1983) A strong Lagrangean relaxation for capacitated plant location
problems. Working Paper 56, Decision Sciences Department, The Wharton School, University
of Pennsylvania
