۱٫ Altay N., Green; III, W.G. (2006). OR/MS Research in Disaster Operations Management. European Journal of Operational Research, 175, 475-493.

۲٫ Jacobsen, S. K.; Madsen, O. B. G. (1980). A Comparative Study of Heuristics for a Two-Level Routing-Location Problem. European Journal of Operational Research, 5, 378-387.

۳٫ Madsen, O. B. G. (1983). Methods for Solving Combined Two Level Location-Routing Problems of Realistic Dimensions. European Journal of Operational Research, 12, 295-301.

۴٫ Nagy, G.; Salhi, S. (1996). Nested Heuristics Methods for the Location-Routing Problem. Journal of Operational Research Society, 47, 1166-1174.

۵٫ Tuzun, D.; Burke, L. I. (1999). A Two-Phase Tabu Search Approach for the Location-Routing Problem. European Journal of Operational Research, 116, 87-99.

۶٫ Boccia, M. et al. (2010). A Metaheuristic for a Two Echelon Location-Routing Problem. Festa P. (eds.) Experimental Algorithms: Lecture Notes in Computer Science, Springer, 6049, 288-301.

۷٫ Nikbakhsh, E.; Zegordi, S. H. (2010). A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints. SCIENTIA IRANIKA, 17, 36-47.

۸٫ Nolz, P. C. et al. (2010). A Bi-Objective Metaheuristic for Disaster Relief Operation Planning. Coello C. A. et al. in Multi Objective Nature Inspired Computing, SCI, 272, 167-187.

۹٫ Crainic, T. G.; Sforza, A.; Sterle, C. (2011a). Location-Routing Models for Two-Echelon Freight Distribution System Design. Technical Report CIRRELT-2011, 40.

۱۰٫ Crainic, T. G.; Sforza, A.; Sterle, C. (2011b). Tabu Search Heuristic for a Two-Echelon Location-Routing Problem. Technical Report CIRRELT-2011-07.

۱۱٫ Rath, S.; Gutjahr, W. J. (2011). A Math-Heuristic for the Warehouse Location-Routing Problem in Disaster Relief. Computers and Operations Research, doi:10.1016/j.cor.2011.07.016.

۱۲٫ Belenguer, J. et al. (2011). A Branch-and-Cut Method for the Capacitated Location-Routing Problem. Computers and Operations Research, 38, 931-941.

۱۳٫ Contardo, C.; Cordeau, J. F.; Gendron, B. (2013). A Computational Comparison of Flow Formulations for the Capacitated Location-Routing Problem. Discrete Optimization, 10, 263-295.

۱۴٫ Contardo, C.; Crainic, T. G.; Hemmelmayr, V. (2012). Lower and Upper Bounds for the Two-Echelon Capacitated Location-Routing Problem. Computers and Operations Research, 39, 3215-3228.

۱۵٫ Nguyen, V.-P.; Prins, C.; Prodhon, C. (2012a). Solving the Two-Echelon Location-Routing Problem by a GRASP Reinforced by a Learning Process and Path Relinking. European Journal of Operational Research, 216, 113-126.

۱۶٫ Nguyen, V.-P.; Prins, C.; Prodhon, C. (2012b). A Multi-Start Iterated Local Search with Tabu List and Path Relinking for the Two-Echelon Location-Routing Problem. Engineering Applications of Artificial Intelligence, 25, 56-71.

۱۷٫ Pirkwieser, S.; Raidl, G. R. (2010). Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. M. J. Blesa, C. Blum, G. Raidl, A. Roli and M. Sampels Hybrid Metaheuristics: Lecture Notes in Computer Science, Springer, 6373, 174-189.

۱۸٫ Schwengerer, M.; Pirkwieser, S.; Raidl, G. R. (2012). A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. J.-K. Hao and M. Middendorf (eds.) Evolutionary Computation in Combinatorial Optimization: Lecture Notes in Computer Science, Springer, 7245, 13-24.

۱۹٫ Naji-Azimi, Z. et al. (2012). A Covering Tour Approach to the Location of Satellite Distribution Centers to Supply Humanitarian Aid. European Journal of Operational Research, 222, 596-605.

۲۰٫ Govindan, K. et al. (2013). Two-Echelon Multiple-Vehicle Location-Routing Problem with Time Windows for Optimization of Sustainable Supply Chain Network of Perishable Food. Int. J. Production Economics,http://dx.doi.org/10.1016/j.ijpe.2013.12.028.

۲۱٫ Wang, H.; Du, L.; Ma, Sh. (2014). Multi-Objective Open Location-Routing Model with Split Delivery for Optimized Relief Distribution in Post-Earthquake. Transportation Research Part E, 69, 160-179.

۲۲٫ Prodhon, C.; Prins, C. (2014). A Survey of Recent Research on Location-Routing Problems. European Journal of Operational Research, http://dx.doi.org/10.1016/j.ejor.2014.01.005.

۲۳٫ Gendreau, M.; Laporte, G.; Semet, F. (1997). The Covering Tour Problem. Operation Research, 45, 568-576.