1 |
Carmeni, P.M., Fratta, L., Maffioli, F. (1975), On improving relaxation method by modified gradient techniques, Mathematical Programming Study 3, 26-34
|
2 |
Galvao, R., ReVelle, C. (2000), A comparison of lagrangean and surrogate relaxation for the maximal covering location problem, European Journal of Operational Research 124, 377-389
|
3 |
Church,R.L., Revelle, C.S. (1974),The Maximal covering location problem, Papers oj the Regional Science Association 32, 101-118
DOI
|
4 |
Held, M., Wolfe, P. and Crowder, H. (1974), Validation of subgradient optimization, Mathematical Programming 6, 6288
|
5 |
Nozick, L.K. (2001), The fixed charge facility location problem with coverage restrictions, Transportation Research Part E 37, 281-296
|
6 |
Mirchandani, P.B., Francis, R.L. (1990), Discrete Location Theory, Wiley, New York
|
7 |
Goicoechea, A., Hansen, D., Duckstein, L. (1982), Multiobjective decision analysis with engineering and business applications, Wiley, New York
|
8 |
Shilling, D.A., ReVell, C., Cohon, J., Elzinga, D.J. (1980), Some models for fire protection locational decisions, European Journal of Operational Research 5,1-7
|
9 |
Crowder, H. (1976), Computational Improvements for Subgradient Optimization, Symposia Mathematica, Academic Press, New York
|
10 |
ReVell, C., Church, R., Schilling, D. (1976), Application of the location set covering problem, Geographical Analysis 8, 65-76
DOI
|
11 |
Nozick, LX., Turnquist, M.A.(1998), Integrating inventory impacts into a fixed charge model for locating distribution centers, Transportation Research Part E 31E (3),173-186
|
12 |
Mirzain, A. (1985), Lagrangian relaxation for the star-star concentrator location problem: approximation algorithm and bounds, Networks 15, 1-20
|
13 |
Daskin, M. (1995), Network and Discrete Location Models, Algorithmsand Applications, Whiley, New York
|
14 |
Parker, R.G., Radin, R.L. (1988), Discrete Optimization, Academic Press, New York
|