M. Albareda-sambola, E. Fernandez, and G. Laporte, The capacity and distance constrained plant location problem, Saldanha da Gama, and V. Verter. Multi?period reverse logistics network design, pp.597-611, 2009.
DOI : 10.1016/j.cor.2007.10.017

N. Azad and H. Davoudpour, A hybrid tabu-SA algorithm for location-inventory model with considering 582 capacity levels and uncertain demands, Journal of Information and Computing Science, vol.3, issue.583, pp.290-304, 2008.

R. Baldacci, A. Mingozzi, and R. W. Calvo, An exact method for the capacitated location-routing problem. 585 Operations Research 59 N5 pp, pp.1284-1296, 2011.

S. Barreto, C. Ferreira, J. Paixão, and B. Santos, Using clustering analysis in a capacitated location-routing problem, European Journal of Operational Research, vol.179, issue.3, pp.968-977, 2007.
DOI : 10.1016/j.ejor.2005.06.074

A. Barros, R. Dekker, and V. Scholten, A two-level network for recycling sand: A case study, European Journal of Operational Research, vol.110, issue.2, pp.199-214, 1998.
DOI : 10.1016/S0377-2217(98)00093-9

I. Correia, T. Melo, F. Saldanha, and . Gama, Comparing classical performance measures for a multi?period, 592 two?echelon supply chain network design problem with sizing decisions, Computers and Industrial Engineering, vol.593, pp.64-366, 2013.

]. R. Farahani, N. Asgari, N. Heidari, M. Hosseininia, M. Goh et al., Covering problems in facility location: a 596 review Computers and Industrial Engineering 62 pp Multicommodity distribution system design by Benders decomposition. Manage- 598 ment Hierarchical placement and network design problems, CSCMP. 23rd annual " state of logistics " report. Council of Supply Chain Management Professionals FOCS00 600 Proceedings of the 41st annual symposium on foundations of computer science pp. 603, 2000. 601 [13] D. R. Karger and M. Minkoff. Building Steiner trees with incomplete global knowledge. FOCS00 Proceedings 602 of the 41st annual symposium on foundations [14] M. Kchaou Boujelben. Modeling and solving a distribution network design problem with multiple opera, pp.595-368, 1974.

S. O. Krumke, C. Thielen, A. Lim, W. Fan, Z. T. Xu-]-m et al., Minimum cost flows with minimum quantities Information processing letters 607 111 pp A transportation problem with minimum quantity commitments Transportation 609 science 40 No. 1 pp Dynamic multi-commodity capacitated facility location: a 611 mathematical modeling framework for strategic supply chain planning. Computers and Operations Research 612 33 pp An efficient heuristic approach for a multi-period logistics 614 network redesign problem Profit-earning facility location An analysis of network location problems with distance constraints. Manage- 617 ment Science 30 N3 pp [21] I. D. Moon and L. Papayanopoulos. Facility location on a tree with maximum distance constraints Location-routing: Issues, models and methods Ndiaye and H. Alfares. Modeling healthcare facility location for moving population groups Prodhon and C. Prins. A survey of recent research on location-routing problems A bibliography for some fundamental problem categories in discrete 627 location science A multi-objective approach to simultaneous strategic and operational planning 629 in supply chain design, tional constraints. Application to a case-study in the automotive industry. Ph.D. Dissertation, Department of 605 Industrial Engineering Computers 619 and Operations Research 22 N9 pp. 905?914 Seedig. Network flow optimization with minimum quantities. In B.Hu, K. Morasch, S. Pickl, and M, pp.606-533, 1984.

L. Berlin-heidelberg-shen, . N. Qi31-]-p, O. Thanh, N. Péton, . J. Bostel-]-c et al., Incorporating inventory and routing costs in strategic location models European Journal 636 of Operational Research 179 pp A linear relaxation-based heuristic approach for logistics network design. 640 Computers and Industrial engineering 59 pp Strategic production distribution models: A critical review with emphasis 642 on global supply chain models Heuristic solutions to multi-depot location-routing problems, Computers 644 and Operations Research 29 pp Zhu, Q. Yuan, A. Garcia-Diaz, and L. Dong. Minimal-cost network flow problems with variable lower 646 bounds on arc flows. Computers and Operations Research 38 pp, pp.635372-389, 1997.