{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T00:14:45Z","timestamp":1693700085257},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,4,25]],"date-time":"2013-04-25T00:00:00Z","timestamp":1366848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10878-013-9617-9","type":"journal-article","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T00:32:17Z","timestamp":1367454737000},"page":"723-738","source":"Crossref","is-referenced-by-count":3,"title":["Optimal-constrained multicast sub-graph over coded packet networks"],"prefix":"10.1007","volume":"29","author":[{"given":"M. A.","family":"Raayatpanah","sequence":"first","affiliation":[]},{"given":"H.","family":"Salehi Fathabadi","sequence":"additional","affiliation":[]},{"given":"H.","family":"Bahramgiri","sequence":"additional","affiliation":[]},{"given":"P. M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,25]]},"reference":[{"issue":"4","key":"9617_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li S, Yeung R (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"9617_CR2","volume-title":"Network flows: theory, algorithms, and applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs"},{"key":"9617_CR3","doi-asserted-by":"crossref","unstructured":"Bazaraa M, Sherali H, Shetty C (2006) Nonlinear programming: theory and algorithms. Wiley-interscience, Hoboken","DOI":"10.1002\/0471787779"},{"key":"9617_CR4","unstructured":"Cai N, Yeung R (2002) Secure network coding. In: Proceedings of the IEEE International Symposium on Information Theory, pp 323\u2013229"},{"key":"9617_CR5","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Desrosiers J, Solomon M (2005) Column generation. Springer, New York","DOI":"10.1007\/b135457"},{"key":"9617_CR6","unstructured":"Desrochers M, Soumis F (1986) A generalized permanent labelling algorithm for the shortest path problem with time windows. Universit\u00e9 de Montr\u00e9al, Centre de recherche surles transports, Montr\u00e9al"},{"key":"9617_CR7","doi-asserted-by":"crossref","unstructured":"Fragouli C, Soljanin E (2008) Network coding applications. Now Publishers","DOI":"10.1561\/9781601980458"},{"key":"9617_CR8","volume-title":"Computers and interatability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and interatability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"issue":"11","key":"9617_CR9","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1049\/iet-com.2010.0612","volume":"5","author":"H Ghasvari","year":"2011","unstructured":"Ghasvari H, Raayatpanah M, Khalaj B, Bakhshi H (2011) Optimal sub-graph selection over coded networks with delay and limited-size buffering the authors consider. IET Commun 5(11):1497\u20131505","journal-title":"IET Commun"},{"issue":"12","key":"9617_CR10","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O Gupta","year":"1985","unstructured":"Gupta O, Ravindran A (1985) Branch and bound experiments in convex nonlinear integer programming. Manag Sci 31(12):1533\u20131546","journal-title":"Manag Sci"},{"issue":"6","key":"9617_CR11","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S Jaggi","year":"2005","unstructured":"Jaggi S, Sanders P, Chou P, Effros M, Egner S, Jain K, Tolhuizen L (2005) Polynomial time algorithms for multicast network code construction. IEEE Trans Inf Theory 51(6):1973\u20131982","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"9617_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/65.397043","volume":"9","author":"W Lee","year":"1995","unstructured":"Lee W, Hluchyi M, Humblet P (1995) Routing subject to quality of service constraints in integrated communication networks. IEEE Netw 9(4):46\u201355","journal-title":"IEEE Netw"},{"issue":"2","key":"9617_CR13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S Li","year":"2003","unstructured":"Li S, Yeung R, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371\u2013381","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"9617_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.phycom.2008.01.006","volume":"1","author":"D Lun","year":"2008","unstructured":"Lun D, M\u00e9dard M, Koetter R, Effros M (2008) Linear network coding. Phys Commun 1(1):3\u201320","journal-title":"Phys Commun"},{"issue":"6","key":"9617_CR15","doi-asserted-by":"crossref","first-page":"2608","DOI":"10.1109\/TIT.2006.874523","volume":"52","author":"D Lun","year":"2006","unstructured":"Lun D, Ratnakar N, M\u00e9dard M, Koetter R, Karger D, Ho T, Ahmed E, Zhao F (2006) Minimum-cost multicast over coded packet networks. IEEE Trans Inf Theory 52(6):2608\u20132623","journal-title":"IEEE Trans Inf Theory"},{"key":"9617_CR16","unstructured":"ILOG Inc (2005) Using the CPLEX callable library and CPLEX mixed integer library. ILOG Inc."},{"key":"9617_CR17","doi-asserted-by":"crossref","unstructured":"Oliveira CAS, Pardalos PM (2011) Mathematical aspects of network routing optimization. Springer, New York","DOI":"10.1007\/978-1-4614-0311-1"},{"key":"9617_CR18","doi-asserted-by":"crossref","unstructured":"Raayatpanah M, Fathabadi HS (2012) Minimum cost multiple multicast network coding with quantized rates. Comput Netw 57:1113\u20131123","DOI":"10.1016\/j.comnet.2012.11.017"},{"key":"9617_CR19","doi-asserted-by":"crossref","unstructured":"Resende MGC, Pardalos PM (2006) Handbook of optimization in telecommunications. Springer, New York","DOI":"10.1007\/978-0-387-30165-5"},{"issue":"2","key":"9617_CR20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N Sahinidis","year":"1996","unstructured":"Sahinidis N (1996) Baron: a general purpose global optimization software package. J Glob Optim 8(2):201\u2013205","journal-title":"J Glob Optim"},{"issue":"2","key":"9617_CR21","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TNET.2009.2026275","volume":"18","author":"Y Xi","year":"2010","unstructured":"Xi Y, Yeh EM (2010) Distributed algorithms for minimum cost multicast with network coding. IEEE\/ACM Trans Netw 18(2):379\u2013392","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"9617_CR22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1561\/0100000007I","volume":"2","author":"R Yeung","year":"2005","unstructured":"Yeung R, Li S, Cai N, Zhang Z (2005) Network coding theory: single sources. Found Trends Commun Inf Theory 2(4):241\u2013329","journal-title":"Found Trends Commun Inf Theory"},{"key":"9617_CR23","unstructured":"Ziegelmann M (2007) Constrained shortest paths and related problems-constrained network optimization. VDM Verlag"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9617-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9617-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9617-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T04:46:36Z","timestamp":1595738796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9617-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,25]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9617"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9617-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,25]]}}}