Upper and lower bounds for the two-level simple plant location problem

Annals of Operations Research

Volumn 86, Issue , 1999, Pages 117-140

  Chardaire, P ^a   Lutton, J L ^b   Sutter, A ^c  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

^b ORANGE LABS   (France)

^c BSO   (France)

Author keywords

Lagrangian relaxation; Plant location; Polyhedral theory; Simulated annealing

Indexed keywords

EID: 0033443067     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018942415824     Document Type: Article

References (19)

1. K. Aardal, Y. Pochet and L. A. Wolsey, Capacited facility location: Valid inequalities and facets, Mathematics of Operations Research 20(1995)562-582.
2. J. Barcelo, E. Fernandez and K.O. Jörnsten, Computational results from a new Lagrangian relaxation algorithm for the capacited plant location problem, European Journal of Operational Research 53(1991)38-45.
3. J.E. Beasley, Lagrangean heuristics for location problems, European Journal of Operational Research 33(1993)383-399.
4. P. Chardaire, J.-L. Lutton and A. Sutter, Thermostatistical persistency: A new improving concept for simulated annealing algorithms, European Journal of Operation Research 86(1995)565-579.
5. P. Chardaire and J.-L. Lutton, Using simulated annealing to solve concentrator location problems in telecommunication networks, in: Applied Simulated Annealing, ed. R.V. Valqui Vidal, a volume of the Lecture Notes Series, Springer, 1993, pp.175-199.
6. G. Cornuéjols, private communication.
7. G. Cornuéjols, M.L. Fisher and G.L. Nemhauser, Location of banks account to optimise float: An analytic study of exact and approximate algorithms, Management Science 23(1977)789-810.
8. G. Cornuéjols, R. Sridharan and J.M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, European Journal of Operational Research 50(1991)280-297.
9. D. Erlenkotter, A dual-based procedure for uncapacited facilities location, Operations Research 26(1978)992-1009.
10. R.L. Francis and P.B. Mirchandani (eds.), Discrete Location Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990.
11. M. Gondran and M. Minoux, Graphs and Algorithms, Wiley-Interscience Series in Discrete Mathematics, 1984.
12. S. Kirkpatrick, C.D. Gelatt, Jr. and M.M. Vecchi, Optimisation by simulated annealing, Science 220(1983)671-680.
13. V.K. Konangi, T. Aidja and C.R. Dhas, On the multilevel concentrator location problem for local access networks, in: Proceedings of IEEE Globecom, 1984, pp. 912-915.
14. J. Krarup and P.M. Pruzan, The simple plant location problem: Survey and synthesis, European Journal of Operational Research 12(1983)36-81.
15. N. Metropolis et al., Equation of state calculations by fast computing machines, Journal of Chemical Physics 21(1953)1087-1092.
16. S. Narasimhan and H. Pirkul, Hierarchical concentrator location problem, Computer Communications 15(1992)185-191.
17. G.L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1988.
18. P. McGregor and D. Shen, Network design: An algorithm for access facility location problems, IEEE Trans. Commun. 25(1977)61-73.
19. G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Computer Networks 6(1982)1-11.