A covering tour approach to the location of satellite distribution centers to supply humanitarian aid

Altay, 2006, OR/MS research in disaster operations management, European Journal of Operational Research, 175, 475, 10.1016/j.ejor.2005.05.016 Baldacci, R., Boschetti, M.A., Maniezzo, V., Zamboni, M., 2005. Scatter search methods for the covering tour problem. In: Sharda, R. et al. (Eds.): Metaheuristic Optimization via Memory and Evolution. Operations Research/Computer Science Interfaces Series, vol. 30, pp. 59–91. Current, 1989, The covering salesman problem, Transportation Science, 23, 208, 10.1287/trsc.23.3.208 Current, 1994, The median tour and maximal covering tour problems: formulations and heuristics, European Journal of Operational Research, 73, 114, 10.1016/0377-2217(94)90149-X Fischetti, 1988, An additive approach for the optimal solution of the prize-collecting traveling salesman problem, 319 Gendreau, 1997, The covering tour problem, Operations Research, 45, 568, 10.1287/opre.45.4.568 Golden B., Naji-Azimi Z., Raghavan S., Salari M., Toth P., Forthcomming. The generalized covering salesman problem. INFORMS Journal on Computing. Hachicha, 2000, Heuristics for the multi-vehicle covering tour problem, Computers and Operations Research, 27, 29, 10.1016/S0305-0548(99)00006-4 Hodgson, 1998, A covering tour model for planning mobile health care facilities in Suhum district, Ghana, Journal of Regional Science, 38, 621, 10.1111/0022-4146.00113 Jozefowiez, 2007, The bi-objective covering tour problem, Computers and Operations Research, 34, 1929, 10.1016/j.cor.2005.07.022 Kara, 2004, A note on the Lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem, European Journal of Operational Research, 158, 793, 10.1016/S0377-2217(03)00377-1 Kedad-Sidhoum, 2010, An exact algorithm for solving the ring star problem, Optimization, 59, 125, 10.1080/02331930903500332 Laporte, 1990, The selective traveling salesman problem, Discrete Applied Mathematics, 26, 193, 10.1016/0166-218X(90)90100-Q Miller, 1960, Integer programming formulations and traveling salesman problems, Journal of the Association for Computing Machinery, 7, 326, 10.1145/321043.321046 Moreno Pérez, 2003, Variable Neighborhood tabu search and its application to the median cycle problem, European Journal of Operational Research, 51, 365, 10.1016/S0377-2217(02)00831-7 Nolz, P.C., Doerner, K.F., Gutjahr, W.J., Hartl, R.F., 2010. A bi-objective metaheuristic for disaster relief operation planning. In: Coello, C.A. et al., (Eds.) A dv. in Multi-Objective Nature Inspired Computing. SCI 272, pp. 167–187. Rekik, M., Ruiz, A., Renaud, J., Berkoune, D., 2011. A decision support system for distribution network design for disaster response. Working paper CIRRELT-2011-36, Interuniversity research centre on enterprise networks, logistics and transportation. Renaud, 2004, Efficient heuristics for median cycle problems, Journal of the Operational Research Society, 55, 179, 10.1057/palgrave.jors.2601672 Tricoire, 2012, The bi-objective stochastic covering tour problem, Computers & Operations Research, 39, 1582, 10.1016/j.cor.2011.09.009 Tzeng, 2007, Multi-objective optimal planning for designing relief delivery systems, Transportation Research Part E, 43, 673, 10.1016/j.tre.2006.10.012