Geoscience Reference
In-Depth Information
Barceló J, Fernández, E, Jörnsten K (1991) Computational results from a new lagrangean
relaxation algorithm for the capacitated plant location problem. Eur J Oper Res 53:38-45
Beasley JE (1988) An algorithm for solving large capacitated warehouse location problems. Eur J
Oper Res 33:314-325
Beasley JE (1993) Lagrangean heuristics for location problems. Eur J Oper Res 65:383-399
Beltran-Royo C, Vial J-P, Alonso-Ayuso A (2012) Semi-lagrangian relaxation applied to the
uncapacitated facility location problem. Comput Optim Appl 51:387-409
Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems.
Numer Math 4:238-252
Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location
problem. Ann Discret Math 1:79-97
Boland N, Domínguez-Marín P, Nickel S, Puerto J (2006) Exact procedures for solving the discrete
ordered median problem. Comput Oper Res 33:3270-3300
Cánovas L, Landete M, Marín A (2000) New facets for the set packing polytope. Oper Res Lett
27:153-161
Cánovas L, Landete M, Marín A (2001) Extreme points of discrete location polyhedra. TOP 9:115-
138
Cánovas L, Landete M, Marín A (2002) On the facets of the simple plant location problem. Discret
Appl Math 124:27-53
Cánovas L, Landete M, Marín A (2003) Facet obtaining procedures for set packing problems.
SIAM J Discret Math 16:127-155
Chen X, Chen Z, Zang W (2012) Total dual integrality in some facility location problems. SIAM J
Discret Math 26:1022-1030
Cho DC, Johnson EL, Padberg MW, Rao MR (1983a) On the uncapacitated plant location problem
I: valid inequalities and facets. Math Oper Res 8:579-589
Cho DC, Padberg MW, Rao MR (1983b) On the uncapacitated plant location problem II: facets
and lifting theorems. Math Oper Res 8:590-612
Christofides N, Beasley JE (1983) Extensions to a lagrangean relaxation approach for the
capacitated warehouse location problem. Eur J Oper Res 12:19-28
Chudak FA, Shmoys DB (1999) Improved approximation algorithms for a capacitated facility
location problem. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete
algorithms, pp 875-886
Contreras I, Fernández E (2014) Hub location as the minimization of a supermodular set function.
Oper Res 62:557-570
Contreras I, Fernández E, Reinelt G (2012) The center facility location/network design problem
with budget constraint. Omega 40:847-860
Cornuéjols GP, Thizy JM (1982) Some facets of the simple plant location polytope. Math Program
23:50-74
Cornuéjols GP, Fisher M, Nemhauser GL (1977) On the uncapacitated location problem. Ann
Discret Math 1:163-177
Cornuéjols GP, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem.
In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley-Interscience, New York
Cornuéjols GP, Sridharan R, Thizy JM (1991) A comparison of heuristics and relaxations for the
capacitated plant location problem. Eur J Oper Res 50:280-297
Correia I, Gouveia LE, Saldanha da Gama F (2010) Discretized formulations for capacitated
location problems with modular distribution costs. Eur J Oper Res 204:237-244
Cortinhal MJ, Captivo ME (2003) Genetic algorithms for the single source capacitated plant
location problem. In: Resende MGC, Pinho de Sousa J, Viana A (eds) Metaheuristics: computer
decision-making. Kluwer Academic Publishers, Boston, pp 187-216
Daskin MS, Coullard CR, Shen ZM (2002) An inventory-location model: formulation, solution
algorithm and computational results. Ann Oper Res 110:83-106
Davis PS, Ray TL (1969) Branch and bound algorithm for the capacitated facilities location
problem. Nav Res Logist Q 16:331-343
Search WWH ::




Custom Search