A Lagrangean heuristic for the facility location problem with staircase costs

European Journal of Operational Research

Volumn 97, Issue 1, 1997, Pages 63-74

  Holmberg, Kaj ^a   Ling, Jonas ^a  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Heuristics; Lagrangeans; Location; Mathematical programming; Staircase costs

Indexed keywords

COSTS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; LOCATION; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES;

FACILITY LOCATION PROBLEM; LAGRANGEAN HEURISTIC; STAIRCASE COSTS;

HEURISTIC METHODS;

EID: 0031076353     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00058-6     Document Type: Article

References (18)

1. Beasly, J.E. (1993), "Lagrangean heuristics for location problems", European Journal of Operational Research 65, 383-399.
2. Bertsekas, D.P., and Tseng, P. (1988), "Fortran codes for network optimization: The relax codes for linear minimum cost network flow problems", Annals of Operations Research 13, 125-190.
3. Bornstein, C.T., and Rust, R. (1988), "Minimizing a sum of staircase functions under linear constraints", Optimization 19, 181-190.
4. Christofides, N., and Beasly, J.E. (1983), "Extensions to a lagrangean relaxation approach for the capacitated warehouse location problem", European Journal of Operational Research 12, 19-28.
5. Cornuejols, G., Sridharan, R., and Thizy, J.M. (1991), "A comparison of heuristics and relaxations for the capacitated plant location problem", European Journal of Operational Research 50, 280-297.
6. Crowder, H. (1976), "Computational improvements for subgradient optimization", in: Symposia Mathematica, Vol XIX, Academic Press, London, 357-372.
7. Domschke, W., and Drexl, A. (1985), "ADD-heuristics' starting procedures for capacitated plant location models", European Journal of Operational Research 21, 47-53.
8. Erlenkotter, D. (1978), "A dual-based procedure for uncapacitated facility location", Operations Research 26, 992-1009.
9. Geoffrion, A., and McBride, R. (1978), "Lagrangean relaxation applied to capacitated facility location problems", AIIE Transactions 10, 40-47.
10. Geoffrion, A.M. (1974), "Lagrangean relaxation for integer programming", Mathematical Programming Study 2, 82-114.
11. Held, M., Wolfe, P., and Crowder, H.P. (1974), "Validation of subgradient optimization", Mathematical Programming 6, 62-88.
12. Hiriart-Urruty, J.-B., and Lemaréchal, C. (1993), Convex Analysis and Minimization Algorithms II, Springer-Verlag.
13. Holmberg, K. (1991), "Linearizations of the staircase cost facility location problem", Research report LiTH-MAT-R-1991-19, Department of Mathematics, Linköping Institute of Technology, Sweden.
14. Holmberg, K. (1994), "Solving the staircase cost facility location problem with decomposition and piecewise linearization", European Journal of Operational Research 75, 41-61.
15. Holmberg, K., and Hellstrand, J. (1994), "Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound", Research report LiTH-MAT-R-1994-11, Department of Mathematics, Linköping Institute of Technology, Sweden; accepted for publication in Operations Research.
16. Jacobsen, S.K. (1983), "Heuristics for the capacitated plant location model", European Journal of Operational Research 12, 253-261.
17. Rech, P., and Barton, L.G. (1970), "A non-convex transportation algorithm", in: E.M. Beale (ed.), Applications of Mathematical Programming Techniques, 250-260.
18. Sridharan, R. (1991), "A Lagrangean heuristic for the capacitated plant location problem with side constraints", Journal of the Operational Research Society 42, 579-585.