The return plant location problem: Modelling and resolution

European Journal of Operational Research

Volumn 104, Issue 2, 1998, Pages 375-392

  Marín, Alfredo ^a   Pelegrín, Blas ^a  

^a UNIVERSITY OF MURCIA   (Spain)

Author keywords

Combinatorial analysis; Facility location; Lagrangian decomposition; Transportation

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LOCATION; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; TRANSPORTATION;

LAGRANGIAN DECOMPOSITION; RETURN PLANT LOCATION PROBLEM;

OPERATIONS RESEARCH;

EID: 0031647393     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00192-6     Document Type: Article

References (13)

1. J. Krarup, P.M. Pruzan, The simple plant location problem: Survey and synthesis, European Journal of Operational Research 12 (1983) 36-81.
2. P. Barcia, K. Jörnsten, Improved Lagrangian decomposition: An application to the generalized assignment problem, European Journal of Operational Research 46 (1990) 84-92.
3. M. Guignard, S. Kim, Lagrangian decomposition for integer programming: Theory and applications, R.A.I.R.O. 21 (1987) 307-323.
4. M. Guignard, S. Kim, Lagrangian decomposition: A model yielding stronger Lagrangian bounds, Mathematical Programming 39 (1987) 215-228.
5. M. Guignard, M.B. Rosenwein, An application-oriented guide for designing Lagrangian dual ascent algorithms, European Journal of Operational Research 43 (1989) 197-205.
6. J. Barceló, E. Fernández, K.O. Jörnsten, Computational results from a new Lagrangian relaxation algorithm for the capacitated plant location problem, European Journal of Operational Research 53 (1991) 38-45.
7. M. Guignard, M.B. Rosenwein, An application of Lagrangian decomposition to the resource-constrained minimum weighted arborescence problem, Networks 20 (1990) 345-359.
8. A. Marín, B. Pelegrín, Heurísticas de descomposición lagrangiana para algunos problemas de localización discreta, Trabajos de Investigatión Operativa 7 (1992) 3-15.
9. A. Marín, B. Pelegrín, The Simple Plant Location Problem under constraints of maximum cost and open facilities, Proceeding of the sixth meeting of the EURO Working Group on Locational Analysis (1993) 145-152.
10. M.S. Bazaraa, J.J. Jarvis, Linear Programming and Network Flows, John Wiley, New York, 1977.
11. U. Akinc, B.M. Khumawala, An efficient branch and bound algorithm for the capacitated warehouse location problem, Management Science 23 (1977) 585-594.
12. J.E. Beasley, OR-library: Distributing test problems by electronic mail, European Journal of Operational Research 43 (1989) 197-205.
13. M. Held, P. Wolfe, H.P. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62-88.