On solving large instances of the capacitated facility location problem

European Journal of Operational Research

Volumn 178, Issue 3, 2007, Pages 663-676

  Sankaran, Jayaram K ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Customer aggregation; Facilities planning and design; Integer programming; Polyhedral approaches; Variable upper bounds

Indexed keywords

COMPUTATION THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; SATELLITES;

CUSTOMER AGGREGATION; FACILITIES PLANNING AND DESIGN; POLYHEDRAL APPROACHES; VARIABLE-UPPER-BOUNDS;

OPERATIONS RESEARCH;

EID: 33751095680     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.01.035     Document Type: Article

References (17)

1. Aardal K. Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming 81 (1998) 149-175
2. Aardal K., Pochet Y., and Wolsey L.A. Capacitated facility location: Valid inequalities and facets. Mathematics of Operations Research 20 (1995) 562-582
3. Aardal K., Pochet Y., and Wolsey L.A. Erratum: Capacitated facility location: Valid inequalities and facets. Mathematics of Operations Research 21 (1996) 253-256
4. Chen B., and Guignard M. Polyhedral analysis and decompositions for capacitated plant location-type problems. Discrete Applied Mathematics 82 (1998) 79-91
5. Deng, Q., Simchi-Levi, D., 1993. Valid inequalities, facets, and computational experience for the capacitated concentrator location problem. Research Report, Department of Industrial Engineering and Operations Research, Columbia University, New York.
6. Francis R.L., and Lowe T.J. On worst-case aggregation analysis for network location problems. Annals of Operations Research 40 (1992) 229-246
7. Francis R.L., Lowe T.J., and Rayco M.B. Row-column aggregation for rectilinear distance p-median problems. Transportation Science 30 (1996) 160-174
8. Geoffrion, A.M., 1976. Customer aggregation in distribution modelling. Working paper No. 259, Western Management Science Institute, University of California, Los Angeles, CA 90024.
9. Hakimi S.L. Optimal locations of switching centers and the absolute centers and medians of a graph. Operations Research 12 (1964) 450-459
10. Hakimi S.L. Optimum distribution of switching centers in a communications network and some related graph-theoretic problems. Operations Research 13 (1965) 462-475
11. Leung J.M.Y., and Magnanti T.L. Valid inequalities and facets of the capacitated plant location problem. Mathematical Programming 44 (1989) 271-291
12. Rayco M.B., Francis R.L., and Lowe T.J. Error-bound driven demand point aggregation for the rectilinear distance p-center model. Location Science 4 (1997) 213-235
13. Sankaran, J.K., 2002. An application of integer programming for facilities planning. Working Paper, Department of Management Science and Information Systems, The University of Auckland, Private Bag 92019, Auckland, New Zealand.
14. Sankaran J.K., and Raghavan N.R.S. Locating and sizing plants for bottling propane in south India. Interfaces 27 (1997) 1-15
15. Savelsbergh M.W.P., Sigismondi G.C., and Nemhauser G.L. Functional description of MINTO, a Mixed INTeger Optimizer. Operations Research Letters 15 (1994) 47-58
16. Schrage L.S. Optimization Modelling with LINDO. fifth ed. (1997), Duxbury Press, Pacific Grove, CA
17. Simchi-Levi D., Kaminsky P., and Simchi-Levi D. Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies. second ed. (2003), Irwin/McGraw-Hill, Burr Ridge, IL