Geoscience Reference
In-Depth Information
Acknowledgements
The work of Bernard Fortz is supported by the Interuniversity Attraction
Poles Program of the Belgian Science Policy Office.
References
Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res
190:1-21
Balakrishnan A, Magnanti T, Wong R (1995) A decomposition algorithm for local access
telecommunications network expansion planning. Oper Res 43:58-76
Balakrishnan A, Magnanti T, Shulman A, Wong R (1991) Models for planning capacity expansion
in local access telecommunication networks. Ann Oper Res 33:239-284
Bardossy M, Raghavan S (2010) Dual-based local search for the connected facility location and
related problems. INFORMS J Comput 22:584-602
Bardossy MG, Raghavan S (2013) Robust optimization for the connected facility location problem.
Electron Notes Discrete Math 44:149-154
Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program
98:49-71
Boffey TB (1989) Location problems arising in computer networks. J Oper Res Soc 40:347-354
Carroll P, Fortz B, Labbé M, McGarraghy S (2013) A branch-and-cut algorithm for the ring spur
assignment problem. Networks 61:89-103
Ceselli A, Liberatore F, Righini G (2009) A computational evaluation of a general branch-and-price
framework for capacitated network location problems. Ann Oper Res 167:209-251
Chen S, Ljubic I, Raghavan S (2010) The regenerator location problem. Networks 55:205-220
Contreras I, Díaz J (2008) Scatter search for the single source capacitated facility location problem.
Ann Oper Res 157:73-89
Contreras I, Fernández E (2012) General network design: a unified view of combined location and
network design problems. Eur J Oper Res 219:680-697
Contreras I, Fernández E, Marín A (2009) Tight bounds from a path based formulation for the tree
of hub location problem. Comput Oper Res 36(12):3117-3127
Contreras I, Fernández E, Marín A (2010) The tree of hubs location problem. Eur J Oper Res
202(2):390-400
Correia I, Gouveia L, Saldanha da Gama F (2010) Discretized formulations for capacitated location
problems with modular distribution costs. Eur J Oper Res 204(2):237-244
Dias TCS, Sousa Filho GF, Macambira EM, Anjos L, Cabral L, Fampa MHC (2006) An efficient
heuristic for the ring star problem. In: Àlvarez C, Serna M (eds) Experimental algorithms.
Lecture notes in computer science, vol 4007. Springer, Berlin/Heidelberg, pp 24-35
Díaz J, Fernández E (2002) A branch-and-price algorithm for the single-source capacitated plant
location. J Oper Res Soc 53:728-470
Duarte A, Martí R, Resende M, Silva R (2014) Improved heuristics for the regenerator location
problem. Int Trans Oper Res 21:541-558
Eisenbrand F, Grandoni F, Rothvoß T, Schäfer G (2010) Connected facility location via random
facility sampling and core detouring. J Comput Syst Sci 76:709-726
Flippo OE, Kolen AW, Koster AM, van de Leensel RL (2000) A dynamic programming
algorithm for the local access telecommunication network expansion problem. Eur J Oper Res
127:189-202
Fortz B, Labbé M (2006) Design of survivable networks. In: Resende M, Pardalos P (eds)
Handbook of optimization in telecommunications, Chap. 15. Springer, New York, pp 367-389
Gendreau M, Potvin JY, Smires A, Soriano P (2006) Multi-period capacity expansion for a local
access telecommunications network. Eur J Oper Res 172(3):1051-1066
Goldschmidt O, Laugier A, Olinick EV (2003) SONET/SDH ring assignment with capacity
constraints. Discret Appl Math 129:99-128
