X. Masip-bruin, M. Yannuzzi, J. Domingo-pascual, A. Fonte, M. Curado et al., Research challenges in QoS routing, Computer Communications, vol.29, issue.5, pp.563-581, 2006.
DOI : 10.1016/j.comcom.2005.06.008
URL : https://hal.archives-ouvertes.fr/hal-01154076

P. V. Mieghem and F. A. Kuipers, Concepts of Exact QoS Routing Algorithms, IEEE/ ACM Transactions on Networking, vol.12, pp.851-864836112, 2004.

F. A. Kuipers and P. V. Mieghem, MAMCRA: a constrained-based multicast routing algorithm, Computer Communications, vol.25, issue.8, pp.802-811, 2002.
DOI : 10.1016/S0140-3664(01)00402-9

M. Molnar, A. Bellabas, and S. Lahoud, The cost optimal solution of the multi-constrained multicast routing problem, Computer Networks, vol.56, issue.13, pp.3136-3149, 2012.
DOI : 10.1016/j.comnet.2012.04.020
URL : https://hal.archives-ouvertes.fr/inria-00529121

V. Aggarwal, Y. P. Aneja, and K. P. Nair, Minimal spanning tree subject to a side constraint, Computers & Operations Research, vol.9, issue.4, pp.287-2960305, 1982.
DOI : 10.1016/0305-0548(82)90026-0

V. Leggieri, M. Haouari, and C. Triki, The Steiner Tree Problem with Delays: A compact formulation and reduction procedures, Discrete Applied Mathematics, vol.164, pp.178-190, 2014.
DOI : 10.1016/j.dam.2011.07.008

L. Gouveia, L. Simonetti, and E. Uchoa, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, Mathematical Programming, pp.123-148, 2011.
DOI : 10.1007/s10107-009-0297-2

V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.286-292, 1993.
DOI : 10.1109/90.234851
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8162

S. Kumar, P. Radoslavov, D. Thaler, C. Alaettinoglu, D. Estrin et al., The MASC/BGMP Architecture for Inter-Domain Multicast Routing, Proceedings of the ACM SIGCOMM'98, pp.93-104, 1998.

Q. Zhu, M. Parsa, and J. J. Garcia-luna-aceves, A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting, Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People, pp.2-6, 1995.

D. Wang, F. Ergun, and Z. Xu, Unicast and Multicast QoS Routing with Multiple Constraints, Quality of Service in Multiservice IP Networks, pp.481-494, 2005.
DOI : 10.1007/978-3-540-30573-6_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.1635

G. Feng, A multi-constrained multicast QoS routing algorithm, Computer Communications, vol.29, issue.10, pp.1811-1822, 2006.
DOI : 10.1016/j.comcom.2005.10.014

T. Korkmaz and M. Krunz, Multi-constrained optimal path selection, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.22-26, 2001.
DOI : 10.1109/INFCOM.2001.916274
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8518

K. Stachowiak and P. Zwierzykowski, Rendezvous point based approach to the multi-constrained multicast routing problem, AEU - International Journal of Electronics and Communications, vol.68, issue.6, pp.561-564, 2014.
DOI : 10.1016/j.aeue.2014.01.002

B. Sun, S. Pi, C. Gui, Y. Zeng, B. Yan et al., Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA, Progress in Natural Science, vol.18, issue.3, pp.331-336, 2008.
DOI : 10.1016/j.pnsc.2007.11.006

T. Lu and J. Zhu, Genetic Algorithm for Energy-Efficient QoS Multicast Routing, IEEE Communications Letters, vol.17, issue.1, pp.31-34, 2013.
DOI : 10.1109/LCOMM.2012.112012.121467

Y. Xu, Metaheuristic Approaches for QoS Multicast Routing Problems, 2011.

S. P. Sahoo, S. Ahmed, M. K. Patel, and M. R. Kabat, A Tree Based Chemical Reaction Optimization Algorithm for QoS Multicast Routing, Swarm, Evolutionary, and Memetic Computing, pp.68-77978, 2013.
DOI : 10.1007/978-3-319-03753-0_7

S. Ruzika and H. W. Hamacher, A Survey on Multiple Objective Minimum Spanning Tree Problems, Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, pp.104-116978, 2009.
DOI : 10.1002/net.3230130203

M. Molnár, Hierarchies to Solve Constrained Connected Spanning Problems, 2011.

R. Bellman, Dynamic Programming, 1957.

X. Zhang, J. Wei, and C. Qiao, Constrained multicast routing in WDM networks with sparse light splitting, Journal of Lightwave Technology, vol.18, issue.12, pp.1917-1927, 2000.
DOI : 10.1109/50.908787

S. Lin, Computer Solutions of the Traveling Salesman Problem. The Bell System Technical Journal, pp.2245-2269, 1965.

A. Newell and G. Ernest, The Search for Generality, 1965.

A. L. Chiu, G. Choudhury, G. Clapp, R. Doverspike, J. W. Gannett et al., Network Design and Architectures for Highly Dynamic Next-Generation IP-over-Optical Long Distance Networks, Optical Fiber Communication Conference and National Fiber Optic Engineers Conference, pp.1878-1890, 2009.
DOI : 10.1364/NFOEC.2009.NThF3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1064

. Accepting-pre-submission-inquiries-through-email, . Facebook, . Linkedin, and . Twitter, A wide selection of journals (inclusive of 9 subjects, more than 200 journals) Providing 24-hour high-quality service User-friendly online submission system Fair and swift peer-review system Efficient typesetting and proofreading procedure Display of the result of downloads and visits, as well as the number of cited articles Maximum dissemination of your research work Submit your manuscript at