Capacitated facility location/network design problems

European Journal of Operational Research

Volumn 129, Issue 3, 2001, Pages 481-495

  Melkote, Sanjay ^a   Daskin, Mark S ^b  

^a Princeton University   (United States)

^b Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SENSITIVITY ANALYSIS; SITE SELECTION; STRATEGIC PLANNING;

CAPACITATED FACILITY LOCATION PROBLEMS (CFLP); MIXED INTEGER PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0035283824     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00464-6     Document Type: Article

References (23)

1. Akinc U., Khumawala B.M. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Science. 23:1977;585-594.
2. Balakrishnan A., Magnanti T.L., Wong R.T. A dual-ascent procedure for large-scale uncapacitated network design. Operations Research. 37:1989;716-740.
3. Berman O., Rahnama M.R. Optimal path of a single service unit on a network to a "nonemergency" destination. Transportation Science. 17:1983;218-232.
4. Christofides N., Beasley J.E. Extensions to a Lagrangian relaxation approach for the capacitated warehouse location problem. European Journal of Operational Research. 12:1983;19-28.
5. Daskin, M.S., 1987. Location, dispatching, and routing models for emergency services with stochastic travel times. In: Ghosh, A., Rushton, G. (Eds.), Spatial Analysis and Location-Allocation Models. Van Nostrand Reinhold, New York, pp. 224-265.
6. Daskin, M.S., 1993. GENRAND2: A random network generator. Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, USA.
7. Daskin, M.S., Hurter, A.P., Van Buer, M.G., 1993. Toward an integrated model of facility location and transportation network design. Working Paper. The Transportation Center, Northwestern University, Evanston, IL, USA.
8. Daskin M.S., Jones P.C. A new approach to solving applied location/allocation problems. Microcomputers in Civil Engineering. 8:1993;409-421.
9. Davis P.S., Ray T.L. A branch-bound algorithm for capacitated facilities location problem. Naval Research Logistics Quarterly. 16:1969;331-344.
10. Fourer R., Gay D.M., Kernighan B.W. AMPL: A Modeling Language for Mathematical Programming. 1993;The Scientific Press, South San Francisco, CA.
11. Guignard M., Spielberg K. A direct dual method for the mixed plant location problem with some side constraints. Mathematical Programming. 17:1979;198-228.
12. Hodgson M.J., Rosing K.E. A network location-allocation model trading off flow capturing and p-median objectives. Annals of Operations Research. 40:1992;247-260.
13. Jacobsen S.K. Heuristics for the capacitated plant location model. European Journal of Operational Research. 12:1983;253-261.
14. Jacobsen, S.K., 1990. Multiperiod capacitated location models. In: Mirchandani, P.B., Francis, R.L. (Eds.), Discrete Location Theory. Wiley, New York, pp. 173-208.
15. Laporte G., Louveaux F.V., Hamme L. Exact solution of a stochastic location problem by an integer L-shaped algorithm. Transportation Science. 28:1994;95-103.
16. Magnanti T.L., Wong R.T. Network design and transportation planning: Models and algorithms. Transportation Science. 18:1984;1-55.
17. Magnanti, T.L., Wong, R.T., 1990. Decomposition methods for facility location problems. In: Mirchandani, P.B., Francis, R.L. (Eds.), Discrete Location Theory. Wiley, New York, pp. 209-262.
18. Melkote, S., Daskin, M.S., 1997. Polynomially solvable cases of combined facility location-network design problems. Networks, Under review.
19. Melkote, S., Daskin, M.S., 2000. An integrated model of facility location and transportation network design. Transportation Research, Forthcoming.
20. Mukundan S., Daskin M.S. Joint location/sizing maximum profit covering models. INFOR. 29:1991;139-152.
21. Simchi-Levi D. The capacitated traveling salesmen location problem. Transportation Science. 25:1991;9-18.
22. Simchi-Levi D., Berman O. A heuristic algorithm for the travelling salesman location problem on networks. Operations Research. 36:1988;478-484.
23. Roy T.J. A cross decomposition algorithm for capacitated facility location. Operations Research. 34:1986;145-163.