Geoscience Reference
In-Depth Information
Mladenovic N, Brimberg J, Hansen P (2006) A note on duality gap in the simple plant location
problem. Eur J Oper Res 174:11-22
Myung YS, Tcha DW (1996) Feasible region reduction cuts for the simple plant location problem.
J Oper Res Soc Jpn 39:614-622
Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649-
672
Nauss RM (1978) An improved algorithm for the capacitated facility location problem. J Oper Res
Soc 29:1195-1201
Neebe AW, Rao MR (1983) An algorithm for the fixed-charge assigning users to sources problem.
J Oper Res Soc 34:1107-1113
Nemhauser GL, Wolsey LA (1981) Maximizing submodular functions: formulations and analysis
of algorithms. Ann Discret Math 11:279-301
Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York
Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing
submodular set functions I. Math Program 14:265-294
Owen SH, Daskin MS (1998) Strategic facility location: a review. Eur J Oper Res 111:423-447
Pirkul H (1987) Efficient algorithms for the capacitated concentrator location problems. Comput
Oper Res 14:197-208
ReVelle CS, Laporte G (1996) The plant location problem: new models and research prospects.
Oper Res 44:864-874
Sá G (1969) Branch and bound and approximate solutions to the capacitated plant-location
problem. Oper Res 17:1005-1016
Sankaran JK (2007) On solving large instances of the capacitated facility location problem. Eur J
Oper Res 178:663-676
Sharma RRK, Berry V (2007) Developing new formulations and relaxations of single stage
capacitated warehouse location problem (SSCWLP): empirical investigation for assessing
relative strengths and computational effort. Eur J Oper Res 177:803-812
Shetty B (1990) Approximate solutions to large scale capacitated facility location problems. Appl
Math Comput 39:159-175
Shmoys DB, Tardos E, Aardal K (1997) Approximation algorithms for facility location problems.
In: Proceedings of the 29th annual ACM symposium on theory of computing (STOC). ACM
Press, New York, pp 265-274
Singh KN (2008) The uncapacitated facility location problem: some applications in scheduling and
routing. Int J Oper Res 5:36-43
Spielberg K (1969a) Plant location with generalized search origin. Manag Sci 16:165-178
Spielberg K (1969b) Algorithms for the simple plant location problem with some side conditions.
Oper Res 17:85-111
Sridharan R (1993) A lagrangian heuristic for the capacitated plant location problem with single
source constraints. Eur J Oper Res 66:305-312
Sridharan R (1995) The capacitated plant location problem. Eur J Oper Res 87:203-213
Stollsteimer JF (1963) A working model for plant numbers and locations. J Farm Econ 45:631-645
Van Roy TJ (1986) A cross decomposition algorithm for capacitated facility location. Oper Res
34:145-163
Verter V (2011) Uncapacitated and capacitated facility location problems. In: Eiselt HA, Marianov
V (eds) Principles of location science. Springer, New York, pp 25-37
Wentges P (1996) Accelerating Benders decomposition for the capacitated facility location
problem. Math Method Oper Res 44:267-290
Wu LY, Zhang XS, Zhang JL (2006) Capacitated facility location problem with general setup cost.
Comput Oper Res 33:1226-1241
Zanjirani Farahani R, SteadieSeifi M, Asgari N (2010) Multiple criteria facility location problems:
a survey. Appl Math Model 34:1689-1709
Zhen Y, Chu F, Chen H (2012) A cut-and-solve based algorithm for the single-source capacitated
facility location problem. Eur J Oper Res 221:521-532
Search WWH ::




Custom Search